How to sum powers of balancing numbers efficiently

Balancing numbers possess, as Fibonacci numbers, a Binet formula. Using this, partial sums of arbitrary powers of balancing numbers can be summed explicitly. For this, as a first step, a power $B_n^l$ is expressed as a linear combination of $B_{mn}$. The summation of such expressions is then easy using generating functions.

No reviews yet.

No comments yet.