Papers
Topics
Authors
Recent
Search
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.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 3 likes about this paper.