A156750 Greedy Egyptian fraction for Pi/2

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

Offset

0,2

Links

Table of n, a(n) for n=0..7.

Wikipedia, Greedy algorithm for Egyptian fractions

Formula

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

Prog

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

Crossrefs

Cf. A001466, A156269, A156736.

Sequence in context: A356587 A227098 A180610 * A292798 A221100 A203310

Adjacent sequences: A156747 A156748 A156749 * A156751 A156752 A156753

Keyword

nonn

Author

Jaume Oliver Lafont, Feb 14 2009

Status

approved