Repdigits in 𝑘-Lucas Sequences
Click here to view fulltext PDF
Permanent link:
https://www.ias.ac.in/article/fulltext/pmsc/124/02/0141-0154
For an integer $k\geq 2$, let $(L_n^{(k)})_n$ be the 𝑘-Lucas sequence which starts with $0,\ldots,0,2,1$ (𝑘 terms) and each term afterwards is the sum of the 𝑘 preceding terms. In 2000, Luca (Port. Math. 57(2) 2000 243-254) proved that 11 is the largest number with only one distinct digit (the so-called repdigit) in the sequence $(L_n^{(2)})_n$. In this paper, we address a similar problem in the family of 𝑘-Lucas sequences. We also show that the 𝑘-Lucas sequences have similar properties to those of 𝑘-Fibonacci sequences and occur in formulae simultaneously with the latter.
Jhon J J Bravo1 Florian Luca2 3
Volume 131, 2021
All articles
Continuous Article Publishing mode
Click here for Editorial Note on CAP Mode
© 2021-2022 Indian Academy of Sciences, Bengaluru.