Jump to content
  • Advertisement
Sign in to follow this  
BeanDog

Sums of kind-of-power-sequences

This topic is 4703 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

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
Advertisement
Perfect, thanks. I had figured out the formula on my own without a formal proof and I wanted to be vindicated :-)



~BenDilts( void );

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!