Linear recurrence sequences and palindromic concatenations of two repdigits in base

Let β be a non-unit real algebraic integer greater than one and {an}n≥0 be a sequence satisfying a linear recurrence relation an + 3 = aan+2 + ban+1 + can. Under certain conditions, we prove that the number of an which are palindromic concatenations of two repdigits in base β is finite.

Authors

Institutions

Publication Details

Journal
Springer Link (Chiba Institute of Technology)
Published
2026-07-16
DOI
https://doi.org/10.1051/ita/2026023/pdf
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Linear recurrence sequences and palindromic concatenations of two repdigits in base

Ruofan Li
Springer Link (Chiba Institute of Technology)
Coding theory and cryptography
article

Linear recurrence sequences and palindromic concatenations of two repdigits in base

Ruofan Li
article en

Abstract

Let β be a non-unit real algebraic integer greater than one and {an}n≥0 be a sequence satisfying a linear recurrence relation an + 3 = aan+2 + ban+1 + can. Under certain conditions, we prove that the number of an which are palindromic concatenations of two repdigits in base β is finite.

Springer Link (Chiba Institute of Technology)
Jinan University (CN)
Reduced inequalities
Openalex Percentile: Top 6%
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.