$n$阶$k$ -广义类Fibonacci数的公式
Formula for the $n$th $k$-Generalized Fibonacci-like Number
摘要:
本文给出了$k$ -广义Fibonacci-like序列的$n$项的计算公式,它是著名的Fibonacci序列的推广,具有$k$任意的初始项,其中后继项是由它前面的$k$项相加得到的.通过观察Fibonacci-like、Tribonacci-like和Tetrabonacci-like序列的第n项公式中的模式,得到了$k$ -广义Fibonacci-like序列的第$n$项公式.推导了$k$ -广义Fibonacci数列的计算公式,并用于证明本文的主要结果。
英文摘要:
In this paper we provided a formula for the $n$th term of the $k$-generalized Fibonacci-like sequence, a generalization of the well-known Fibonacci sequence, having $k$ arbitrary initial terms, where the succeeding terms are obtained by adding its previous $k$ terms. The formula for the $n$th term of the $k$-generalized Fibonacci-like sequence was obtained by observing patterns in the derived formula for the nth term of the Fibonacci-like, Tribonacci-like, and Tetrabonacci-like sequence. The formula for the $k$-generalized Fibonacci sequence was also derived and was used in the process of proving the main result of this paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。