On arithmetic progressions in Lucas sequences
From MaRDI portal
Publication:5364147
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
(15)- scientific article; zbMATH DE number 1408154 (Why is no real title available?)
- On arithmetic progressions in Lucas sequences. II
- Connection in mathematics: Lucas sequence via arithmetic progression
- Geometric aspects of Lucas sequences. II
- A method for computing Lucas sequences
- On harmonic numbers and Lucas sequences
- Some arithmetic functions of factorials in Lucas sequences
- Using Lucas sequences to generalize a theorem of Sierpiński
- On geometric progressions on Pell equations and Lucas sequences
- Practical numbers in Lucas sequences
- Lucas sequences containing few primes
- scientific article; zbMATH DE number 1420976 (Why is no real title available?)
- Arithmetic progressions in the values of a quadratic polynomial
- Coincidences in generalized Lucas sequences
- Longest arithmetic progressions of palindromes
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)