arXiv · 2008.03916
How to sum powers of balancing numbers efficiently
Abstract
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.
Explore related subjects
Keep this discovery
Helmut Prodinger. 2020-08-10. How to sum powers of balancing numbers efficiently. https://arxiv.org/abs/2008.03916
Cite the original work for its findings. Save a collection to share your selection of sources.