论文信息 - A summation formula for generalized $k$-bonacci numbers

A summation formula for generalized $k$-bonacci numbers

In this note, we present a simple summation formula for k -bonacci numbers. The derivation consists in obtaining the generating function of such numbers, and noting that its evaluation at a particular value yields a formula generalizing a known expression for Fibonacci numbers.

J. Pain

[1] Harold R. Parks,et al. Sums of k-bonacci Numbers , 2022, ArXiv.

[2] MARIE LEJEUNE,et al. Templates for the k-Binomial Complexity of the Tribonacci Word , 2019, WORDS.

[3] Bijendra Singh,et al. Generalized Fibonacci Polynomials , 2013 .

[4] M. Livio. The Golden Ratio: The Story of Phi, the World's Most Astonishing Number , 2002 .

[5] Sang-Gu Lee,et al. THE BINET FORMULA AND REPRESENTATIONS OF ^-GENERALIZED FIBONACCI NUMBERS , 1999 .

[6] Jean Pedersen,et al. Fibonacci and Lucas Numbers , 1997 .

[7] S. Vajda. Fibonacci and Lucas Numbers and the Golden Section , 1989 .