Sums of k-bonacci Numbers
We give a combinatorial proof of a formula giving the partial sums of the k-bonacci sequence as alternating sums of powers of two multiplied by binomial coefficients. As a corollary we obtain a formula for the k-bonacci numbers.
READ FULL TEXT