English

$k$-Fibonacci numbers that are palindromic concatenations of two distinct Repdigits

Number Theory 2025-04-15 v1

Abstract

Let k2k\ge 2 and {Fn(k)}n2k\{F_n^{(k)}\}_{n\geq 2-k} be the sequence of kk--generalized Fibonacci numbers whose first kk terms are 0,,0,0,10,\ldots,0,0,1 and each term afterwards is the sum of the preceding kk terms. In this paper, we determine all kk-Fibonacci numbers that are palindromic concatenations of two distinct repdigits.

Keywords

Cite

@article{arxiv.2504.10138,
  title  = {$k$-Fibonacci numbers that are palindromic concatenations of two distinct Repdigits},
  author = {Herbert Batte and Florian Luca},
  journal= {arXiv preprint arXiv:2504.10138},
  year   = {2025}
}

Comments

14 pages