2000 character limit reached
$k$-Fibonacci numbers that are palindromic concatenations of two distinct Repdigits
Published 14 Apr 2025 in math.NT | (2504.10138v1)
Abstract: Let $k\ge 2$ and ${F_n{(k)}}_{n\geq 2-k}$ be the sequence of $k$--generalized Fibonacci numbers whose first $k$ terms are $0,\ldots,0,0,1$ and each term afterwards is the sum of the preceding $k$ terms. In this paper, we determine all $k$-Fibonacci numbers that are palindromic concatenations of two distinct repdigits.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.