2000 character limit reached
On Palindromic forms in the $k$-Lucas sequence composed of two distinct Repdigits
Published 6 May 2025 in math.GM | (2505.09638v2)
Abstract: For integers $k \geq 2$, the $k$-generalized Lucas sequence ${L_n{(k)}}_{n \geq 2-k}$ is defined by the recurrence relation [ L_n{(k)} = L_{n-1}{(k)} + \cdots + L_{n-k}{(k)} \quad \text{for } n \geq 2, ] with initial terms given by $L_0{(k)} = 2$, $L_1{(k)} = 1$, and $L_{2-k}{(k)} = \cdots = L_{-1}{(k)} = 0$. In this paper, we extend work in \cite{Lucas} and show that the result in \cite{Lucas} still holds for $k\ge 3$, that is, we show that for $k\ge 3$, there is no $k$-generalized Lucas number appearing as a palindrome formed by concatenating 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.