The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A157718 Greedy Egyptian fraction expansion of log(3). 0
 1, 11, 130, 91827, 42593758221, 2068726045016880942060, 20697114911379630588051784011292634933847536, 832769470129253476302780470023395858447487389073547955500158020204885523374048803963217 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Wikipedia, Greedy algorithm for Egyptian fractions EXAMPLE log(3) = Sum_{n>=0} 1/a(n) = 1/1 + 1/11 + 1/130 + 1/91827 + 1/42593758221 + ... PROG (PARI) x=log(3); for (k=1, 8, d=ceil(1/x); x=x-1/d; print(d, ", ")) CROSSREFS Cf. A058962, A154920, A157024, A002391, A118324. Sequence in context: A015603 A184280 A266947 * A256957 A046210 A100757 Adjacent sequences: A157715 A157716 A157717 * A157719 A157720 A157721 KEYWORD frac,nonn AUTHOR Jaume Oliver Lafont, Mar 04 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 4 19:07 EST 2022. Contains 358563 sequences. (Running on oeis4.)