Almost Repdigits in k-generalized Lucas Sequences

From MaRDI portal
Almost Repdigits in $ k-$generalized Lucas Sequences




Abstract: Let kgeq2 and (Ln(k))ngeq2−k be the k−generalized Lucas sequence with initial condition L2−k(k)=cdots=L−1(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 k−generalized Lucas sequences which are almost repdigits. In particular, we find all k−generalized 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)