|
Search: id:A156750
|
|
|
| A156750 |
|
Greedy Egyptian fraction for Pi/2 |
|
+0
2
|
|
| 1, 2, 15, 243, 69282, 36600664305, 6435072487994269232829, 364103502021384610224777078613738432189483892
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
LINKS
|
Wikipedia, Greedy algorithm for Egyptian fractions
|
|
FORMULA
|
Sum(n>=0,1/a(n))=Pi/2
|
|
PROGRAM
|
(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: A090301 A097628 A161968 this_sequence A102555 A143886 A076111
Adjacent sequences: A156747 A156748 A156749 this_sequence A156751 A156752 A156753
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Feb 14 2009
|
|
|
Search completed in 0.002 seconds
|
