Was doing some benchmarks for the mpmath python library on my pc with randomly generated tests.
I found that one of those tests was returning a multiple of $\pi$ consistently. I report it here:
from mpmath import *
mp.dps=50
print "correct pi: ", pi
den=mpf("3")
a=0
res=0
for n in xrange(0,1000):
res=res+1/den
a=a+32
den=den+a
print "result: ", res*8
Result:
correct pi: 3.1415926535897932384626433832795028841971693993751
result: 3.1410926536210432286970258295579986968615976706527
The convergence rate is very low. 10000 terms only give accuracy to the 5th-4th decimal digit. Is it there somewhere a formula for pi that involves the number 32?
Per String's answer, continuing from his result we have \begin{align*} res &= \sum_{i=0}^{\infty}\frac{1}{16i(i+1)+3}\\ &= \sum_{i=0}^{\infty} \frac{1}{(4i+1)(4i+3)} \\ &= \frac{1}{2}\sum_{i=0}^{\infty} \left(\frac{1}{4i+1}-\frac{1}{4i+3}\right) \\ &= \frac{1}{2}\left(\frac{1}{1} - \frac{1}{3} + \frac{1}{5} - \frac{1}{7} + \cdots\right) \\ &= \frac{\pi}{8}. \end{align*} This derivation also explains why the series converges so slowly....this particular approximation converges as the alternating harmonic series converges to zero, which is very slow.