This is a claim in a textbook that I'm using, although it was not proven.
When trying this for small $n$'s it is clear.
\begin{align} 2^2&=1+1+2^1=4\\ 2^3&=1+1+2+2^2\\ 2^4&=1+1+2+4+2^3 \end{align}
What I was thinking for the proof was $2^{n-1}=2(2^{n-2})=2^{n-2}+2^{n-2}$, but obviously that's not incorporating addition, so I don't know where to go on. Is it just expressing $2^{n-2}$ as the first summation?
It's because it's a geometric progression. Since
$$1+p_i+{p_i}^2+··· +{p_i}^{a_i} = \dfrac{{p_i}^{a_i+1}-1}{p_i-1}. $$
you just add an extra one at the start of the progression.