Sign in to follow this  
BeanDog

Sums of kind-of-power-sequences

Recommended Posts

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 );

Share this post


Link to post
Share on other sites

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Sign in to follow this