Almost Repdigits in k-generalized Lucas Sequences

From MaRDI portal
Publication:6423693

arXiv2301.07334MaRDI QIDQ6423693FDOQ6423693


Authors: Alaa Altassan, Murat Alan Edit this on Wikidata


Publication date: 18 January 2023

Abstract: Let kgeq2 and (Ln(k))ngeq2k be the kgeneralized Lucas sequence with initial condition L2k(k)=cdots=L1(k)=0, L0(k,=2, L1(k)=1 and each term afterwards is the sum of the k preceding terms. A positive integer is an almost repdigit if its digits are all equal except for at most one digit. In this paper, we work on the problem of determining all terms of kgeneralized Lucas sequences which are almost repdigits. In particular, we find all kgeneralized Lucas numbers which are powers of 10 as a special case of almost repdigits.













This page was built for publication: Almost Repdigits in $ k-$generalized Lucas Sequences

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6423693)