A156750 Greedy Egyptian fraction for Pi/2.

1, 2, 15, 243, 69282, 36600664305, 6435072487994269232829, 364103502021384610224777078613738432189483892

Offset: 0

Author

Jaume Oliver Lafont, Feb 14 2009

Keywords

• nonn

Links

• Wikipedia, Greedy algorithm for Egyptian fractions

Crossrefs

Cf. A001466, A156269, A156736.

Programs

PARI

x=Pi/2; for (k=0, 7, d=ceil(1/x); x=x-1/d; print(d,", "))

Formula

Sum(n>=0,1/a(n))=Pi/2