Sums of k-bonacci Numbers

08/02/2022
by   Harold R. Parks, et al.
0

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

page 1

page 2

page 3

page 4

research
08/15/2022

An Elementary Proof of the Generalization of the Binet Formula for k-bonacci Numbers

We present an elementary proof of the generalization of the k-bonacci Bi...
research
11/19/2022

Littlewood-Richardson coefficients as a signed sum of Kostka numbers

Littlewood-Richardson (LR) coefficients and Kostka Numbers appear in rep...
research
09/23/2019

Whitney Numbers of Combinatorial Geometries and Higher-Weight Dowling Lattices

We study the Whitney numbers of the first kind of combinatorial geometri...
research
12/07/2019

Dances between continuous and discrete: Euler's summation formula

Leonhard Euler likely developed his summation formula in 1732, and soon ...
research
10/31/2010

Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci

Two very fast and simple O(lg n) algorithms for individual Fibonacci num...
research
10/18/2019

Minimal automaton for multiplying and translating the Thue-Morse set

The Thue-Morse set T is the set of those non-negative integers whose bin...
research
02/15/2021

Preimages under the Queuesort algorithm

Following the footprints of what have been done with the algorithm Stack...

Please sign up or login with your details

Forgot password? Click here to reset