Extrapolate a sum using partial sums at powers of two In an online textbook for MIT OCW 18.013a, Calculus with Applications, the author uses residue calculus to derive the well-known formula
$$\sum_{n>0} n^{-2} = \frac{\pi^2}{6}$$
(See Some Special Tricks)
He then writes:

You can actually sum the first 128 (or 1024) terms of this sum on a spreadsheet and extrapolate by comparing the sum up to different powers of 2.  If you extrapolate first forming $S_2(k) = S(2^k)-S(2^{k-1})$, then $S_3(k)=(4 S_2(k) - S_2(k-1))/3$ then $S_4(k) = (8 S_3(k) - S_3(k-1))/7$. etc.  You can get this answer to enormous accuracy numerically and verify this conclusion.

Would someone please explain this method of extrapolation or provide a suitable reference?

This follows from the Euler–Maclaurin formula, we have:
$$\sum_{n = N}^{\infty} f(n) = \int_{N}^{\infty}f(x) dx + \frac{1}{2}f(N) -\sum_{k=1}^{M}\frac{B_{2k}}{(2k)!}f^{(2k-1)}(N) + R_M$$
where the $B_{2k}$ are the Bernoulli numbers and $R_M$ is a remainder term. In case of $f(n) = \dfrac{1}{n^2}$, this yields:
$$\sum_{n = N}^{\infty} \frac{1}{n^2} = \frac{1}{N} + \frac{1}{2 N^2} +\sum_{k=1}^{M}\frac{B_{2 k}}{N^{2k+1}} + R_M$$
This means that you can extrapolate more efficiently first with the $\dfrac{1}{N}$ and the $\dfrac{1}{2 N^2}$ and from then onward only with the reciprocals of only the odd powers of $N$. Note that doubling $N$ means keeping terms up to that new $N$ minus 1, otherwise you see from re-expanding $\dfrac{1}{(N+1)^{2k+1}}$ in powers of $\dfrac{1}{N}$ that you get both even and odd powers, the extrapolation would then become less efficient.
