Narayana’s cows numbers which are concatenations of three repdigits in base ρ
preprint
OA: closed
CC-BY-4.0
Abstract
Abstract \noindent Narayana's sequence is a ternary recurrent sequence defined by the recurrence relation $\mathcal{N}_n=\mathcal{N}_{n-1}+\mathcal{N}_{n-3}$ with initial terms $\mathcal{N}_0=0$ and $\mathcal{N}_1=\mathcal{N}_2=\mathcal{N}_3=1$. Let $\rho\geqslant2$ be a positive integer. In this study, it is proved that the $n$th Narayana number $ \mathcal{N}_n$ which are concatenations of three repdigits in base $\rho$ satisfies $n<5.6\cdot 10^{48}\cdot \log^7\rho$. Moreover, it is shown that the largest Narayana's number which are concatenations of three repdigits in base $\rho$ with $1\leqslant \rho\leqslant 10$ is $58425=\mathcal{N}_{31}=\overline{3332200}_5=\overline{332223}_7 .$
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.
Source provenance
- europepmc
- last seen: 2026-05-19T01:45:01.086888+00:00
- unpaywall
- last seen: 2026-05-26T02:00:01.498150+00:00
License: CC-BY-4.0