Palindromic Concatenations of Two Distinct Repdigits in Narayana’s Cows Sequence

Let \((N_{n})_{n\ge 0}\) ${(N_n)}_{n\ge 0}$ be Narayana’s cows sequence given by a recurrence relation \( N_{n+3}=N_{n+2}+N_n \) $N_{n+3}=N_{n+2}+N_n$ for all \( n\ge 0 \) $n\ge 0$ , with initial conditions \( N_0=0 \) $N_0=0$ , and \( N_1= N_2=1 \) $N_1=N_2=1$ . In this paper, we find all members in Narayana’s cows sequence that are palindromic concatenations of two distinct repdigits. Our proofs use techniques on Diophantine approximation which include the theory of linear forms in logarithms of algebraic numbers and Baker’s reduction method. We show that 595 is the only member in Narayana’s cow sequence that is a palindromic concatenation of two distinct repdigits in base 10.