























Narayana's cows problem is a problem similar to the Fibonacci's rabbit problem. We define the numbers which are the solutions of this problem as Narayana's cows numbers. Narayana's cows sequence satisfies the third order recurrence relation $N_{r}=N_{r-1}+N_{r-3}$ ($r\geq3$) with initial condition $N_{0} =0$, $N_{1} = N_{2}= 1$. In this paper, the $ar+b$ subscripted Narayana numbers will be expressed by three $a$ step apart Narayana numbers for any $1\leq b\leq a$ ($a\in \mathbb{Z}$). Furthermore, we study the sum $S_{N,r}^{(4,b)}=\sum_{k=0}^{r}N_{4k+b}$ of $4$ step apart Narayana numbers for any $1\leq b\leq 4$.
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。