k-Fibonacci numbers that are palindromic concatenations of two distinct Repdigits
Abstract
Let k 2 and \Fn(k)\n≥ 2-k be the sequence of k--generalized Fibonacci numbers whose first k terms are 0,…,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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.