Sums of kind-of-power-sequences
Author
I don't know exactly what to call what I'm trying to describe here, which is why I couldn't just google up an answer :-)
I'm looking for an explicit formula for sum(i=0->n)[k^n] in terms of n and k.
In other words, for k=2 and n=5, 1 + 2 + 4 + 8 + 16 + 32 = 63.
or, for k=4, n=3, 1 + 4 + 16 + 64 = 85.
Any good links?
~BenDilts( void );
Author
Perfect, thanks. I had figured out the formula on my own without a formal proof and I wanted to be vindicated :-)
~BenDilts( void );
~BenDilts( void );
This topic is closed to new replies.
Advertisement
Popular Topics
Advertisement
