论文标题
Narayana的牛序列的成员是两个repdigits的串联
Members of Narayana's cow sequence that are concatenations of two repdigits
论文作者
论文摘要
令$（n_n）_ {n \ ge 0} $为narayana的牛序列，由三阶复发关系$ n_0 = 0，\ n_1 = n_1 = n_2 = 1 $，$ n_ {n+3} = n_在本文中，我们确定了所有纳拉亚纳数字，这些数字是两个重新数的串联。我们的主要定理的证明使用对数中线性形式的下限，以及在Diophantine近似中的Baker-Davenport减少方法的版本。
Let $ (N_n)_{n\ge 0}$ be the Narayana's cow sequence defined by a third-order recurrence relation $ N_0=0,\ N_1= N_2=1 $, and $ N_{n+3}=N_{n+2}+N_n $ for all $ n\ge 0 $. In this paper, we determine all Narayana numbers that are concatenations of two repdigits. The proof of our main theorem uses lower bounds for linear forms in logarithms and a version of the Baker-Davenport reduction method in Diophantine approximation.
