A276779 a(n) = floor(log_10(1/error(n))), where error(n) is the error in the n-th iteration of the cubic Borwein-Borwein algorithm for computing 1/Pi.

6, 22, 71, 218, 659, 1985, 5963, 17898, 53704, 161124, 483384, 1450164, 4350505, 13051531, 39154610, 117463847, 301029987, 301029987

Offset

1,1

References

J. M. Borwein and P. B. Borwein, Pi and the AGM, Wiley, 1987.

Links

Table of n, a(n) for n=1..18.

D. H. Bailey, J. M. Borwein, P. B. Borwein, and S. Plouffe, The Quest for Pi, Mathematical Intelligencer, vol. 19, no. 1 (Jan. 1997), 50-57.

Lucas A. Brown, Python program.

Shalosh B. Ekhad, Three New Sequences for the OEIS, in Fond Memory of Jon Borwein (1951-2016)

Doron Zeilberger, Jonathan Borwein (1951-2016), a PiONEER of Experimental Mathematics, Experimental Mathematics Seminar, Rutgers University, Sep 15 2016.

Crossrefs

Cf. A276778, A276780.

Sequence in context: A351648 A171495 A178706 * A159555 A032195 A217530

Adjacent sequences: A276776 A276777 A276778 * A276780 A276781 A276782

Keyword

nonn,hard,more

Author

Doron Zeilberger, Sep 18 2016

Extensions

Revised definition and terms a(11)-a(18) from Lucas A. Brown, May 05 2023

Status

approved