Let p be a prime. A famous theorem of Lucas states that ((mp+s)(np+t)) n= (
m)(n) ((t) (s)) (mod p) if m, n, s, t are nonnegative integers with s, t <
p. In this paper we aim to prove a similar result for generalized binomial
coefficients defined in terms of second order recurrent sequences with init
ial values 0 and 1.