Today, a friend and I have been trying to find a general formula for the partial sums of a series that goes like this: $$ 1, 2, 8, 64, 1024, \cdots $$ we came up with a recursive formula for it: $$a(n) = 2^n\\ b(0) = 1\\ b(n>0) = a(n)\cdot b(n-1)$$ and I've managed to determine that it's some form of hypergeometric series. I've tried deciphering the Wikipedia page on the generalized hypergeometric series but there's far too much information overflow for me to properly understand it, and therefore I've been unable to find the formula we've been looking for.
What I'm asking is for
a more simplified (doesn't need to be in layman's terms, but still understandable to someone with only high-school and olympiad math experience) explanation of generalized hypergeometric series
and
what the formula is for the partial sums of the sequence, and how you got the formula.
as always, any assistance would be appreciated. Thanks.
You are looking for $$S_p=\sum_{n=1}^p 2^{\frac{1}{2} n(n-1) }$$ which generates the sequence $$\{1,3,11,75,1099,33867,2131019,270566475,68990043211,35253362132043\}$$ which is sequence $A181388$ in $OEIS$.
There is almost no information about it but the terms are increasing so fast$(\frac {a_{n+1}}{a_n}=2^n)$ that $$S_p\sim 2^{\frac{1}{2} p(p-1) }$$ could be more than sufficient. It would give the sequence $$\{1,2,8,64,1024,32768,2097152,268435456,68719476736,35184372088832\}$$