But the one found by this machine seems to be new; see the paper: http://www.ramanujanmachine.com/paper (or with some comments at https://fermatslibrary.com/s/the-ramanujan-machine-automatic... )
It would seem more natural to rewrite it like this
-4/pi = −1 + 1/(−4 + −2 /(−7 + −9/(−10 + −20/(−13+...))))
which avoids the gratuitously different first numerator -- but I guess they wanted to reproduce results exactly as they happened to emerge from their program.
I think this is, further, equivalent to the following which avoids some gratuitous-looking minus signs:
4/pi = 1 + 1/(4 + −2 /(7 + −9/(10 + −20/(13+...))))
Continuing the fraction using the quadratic polynomial I gave above does indeed seem to make it converge to 4/pi, though not very quickly.
Clearly these k_n divide n!, so maybe the right way to say this is that the conjecture seems to be equivalent to 4/pi = product (a_n+n!)/a_n where (a_n) = (4,130,2464,45448,882528,18410640,...) ... though I don't know what that sequence _is_, haven't shown that it has a nice form, etc. None of (a_n), (a_n+n!), (a_n+n!/2) seems to occur in OEIS or to be a subsequence of anything in OEIS.
True, but there are regular generalized continuous fractions for pi [1].
[1] https://en.wikipedia.org/wiki/William_Brouncker,_2nd_Viscoun...
pi/−4 = 1/(−1 + 1/(−4 + −2 /(−7 + −9/(−10 + −20/(−13+...))))
What exactly am supposed to prove here? The denominators are an arithmetic progression but numerators (1, 1, -2, -9, -20, ...) are just some bizarre sequence without an obvious pattern. The thing with continous fractions is that every number has one, so the fact that pi is presented as continous fraction is not impressive in itself.