Math help anyone?

Okay, so I have the recursive series ofT1 = 1Tn = 2(Tn-1(previous term)) + 1What is the formula for the sum of a finite series like this?For your easeTerms: 1,3,7,15,31,63...Sums: 1,4,11,26,57,120...Everyone in OT seems pretty smart, I'm sure someone out there can help me...Brownie points for anyone who can answer my question.Math help anyone?
E=mc2



Its gotta be rightMath help anyone?
the sum from n=1 to N of the equation 2^n -1
[QUOTE=''Brutal_Elitegs'']the sum from n=1 to N of the equation 2^n -1[/QUOTE]

Are you saying that the sum of the series is the formula 2^n - 1?
yes
[QUOTE=''Brutal_Elitegs'']yes[/QUOTE]

I tried plugging in the numbers into 2^n - 1, but I pull not the sum of the terms, but rather the terms themselves.

Namely: 1,3,7,15,31... (Fits in with Tn = 2(Tn-1) +1)

I'm tryinig to find the formula for the sum of the series. The sum series is 1,4,11,26,57...

Thanks for trying though!
Obviously you need to create an amortization schedule.
[QUOTE=''waffle57''][QUOTE=''Brutal_Elitegs'']yes[/QUOTE] I tried plugging in the numbers into 2^n - 1, but I pull not the sum of the terms, but rather the terms themselves. Namely: 1,3,7,15,31... (Fits in with Tn = 2(Tn-1) +1) I'm tryinig to find the formula for the sum of the series. The sum series is 1,4,11,26,57... Thanks for trying though![/QUOTE]That's what is is. It is the sum (capital sigma) from n=1 to N of 2^n-1. 2^n-1 is the series.
what math level is this?
[QUOTE=''waffle57''][QUOTE=''Brutal_Elitegs'']yes[/QUOTE]

I tried plugging in the numbers into 2^n - 1, but I pull not the sum of the terms, but rather the terms themselves.

Namely: 1,3,7,15,31... (Fits in with Tn = 2(Tn-1) +1)

I'm tryinig to find the formula for the sum of the series. The sum series is 1,4,11,26,57...

Thanks for trying though![/QUOTE]

In that case the equation is 2^n - n -1 for n >= 2
This is why you should always read the stickied threads before posting.