Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A157718
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A157718 Greedy Egyptian fraction expansion of log(3). +0
1
1, 11, 130, 91827, 42593758221, 2068726045016880942060, 20697114911379630588051784011292634933847536, 83276947012925347630278047002339585844748738907354795550015802020488552337404880\ 3963217 (list; graph; listen)
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 + ...

PROGRAM

(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: A024144 A015602 A015603 this_sequence A046210 A100757 A099677

Adjacent sequences: A157715 A157716 A157717 this_sequence A157719 A157720 A157721

KEYWORD

frac,nonn

AUTHOR

Jaume Oliver Lafont (joliverlafont(AT)gmail.com), Mar 04 2009

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research