English

Almost Repdigits in $ k-$generalized Lucas Sequences

Number Theory 2023-01-19 v1

Abstract

Let k2 k \geq 2 and (Ln(k))n2k ( L_{n}^{(k)} )_{n \geq 2-k} be the kk-generalized Lucas sequence with initial condition L2k(k)==L1(k)=0, L_{2-k}^{(k)} = \cdots = L_{-1}^{(k)}=0 , L0(k,=2, L_{0}^{(k,}=2, L1(k)=1 L_{1}^{(k)}=1 and each term afterwards is the sum of the k 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 kk-generalized Lucas sequences which are almost repdigits. In particular, we find all kk-generalized Lucas numbers which are powers of 1010 as a special case of almost repdigits.

Cite

@article{arxiv.2301.07334,
  title  = {Almost Repdigits in $ k-$generalized Lucas Sequences},
  author = {Alaa Altassan and Murat Alan},
  journal= {arXiv preprint arXiv:2301.07334},
  year   = {2023}
}
R2 v1 2026-06-28T08:14:10.566Z