On arithmetic progressions in Lucas sequences
From MaRDI portal
Abstract: 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.
Recommendations
Cited in
(17)- A method for computing Lucas sequences
- Longest arithmetic progressions of palindromes
- Geometric aspects of Lucas sequences. II
- On arithmetic progressions in Lucas sequences. II
- Connection in mathematics: Lucas sequence via arithmetic progression
- On geometric progressions on Pell equations and Lucas sequences
- On harmonic numbers and Lucas sequences
- Using Lucas sequences to generalize a theorem of Sierpiński
- scientific article; zbMATH DE number 1408154 (Why is no real title available?)
- scientific article; zbMATH DE number 1420976 (Why is no real title available?)
- Lucas sequences containing few primes
- Arithmetic progressions in the values of a quadratic polynomial
- Some arithmetic functions of factorials in Lucas sequences
- Coincidences in generalized Lucas sequences
- Practical numbers in Lucas sequences
- Integers represented by binary recursive sequences
- Integers represented by Lucas sequences
This page was built for publication: On arithmetic progressions in Lucas sequences
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5364147)