📝 SummarXiv

Abstract

The Tribonacci-Lucas sequence $\{S_n\}_{n\ge 0}$ is defined by the linear recurrence relation $S_{n+3} = S_{n+2} + S_{n+1} + S_n$, for $ n\ge 0 $, with the initial conditions $S_0 =S_2= 3$ and $S_1 = 1$. A palindromic number is a number that remains the same when its digits are reversed. This paper uses Baker's theory for nozero lower bounds for linear forms in logarithms of algebraic numbers, and reduction methods involving the theory of continued fraction to determine all Tribonacci-Lucas numbers that are palindromic concatenations of two distinct repdigits.