  In this paper, we consider arithmetic progressions contained in Lucas
sequences of first and second kind. We prove that for almost all sequences,
there are only finitely many and their number can be effectively bounded. We
also show that there are only a few sequences which contain infinitely many and
one can explicitly list both the sequences and the progressions in them. A more
precise statement is given for sequences with dominant root.
