login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A100678 Number of Egyptian fractions in the representation of n/(n+1) via the greedy algorithm. 6
1, 2, 2, 3, 2, 3, 3, 3, 3, 4, 3, 4, 4, 3, 4, 5, 3, 4, 4, 4, 4, 5, 3, 4, 4, 4, 4, 5, 4, 6, 4, 4, 5, 5, 4, 5, 5, 5, 4, 5, 3, 4, 4, 4, 4, 5, 4, 4, 5, 4, 5, 5, 4, 5, 4, 5, 5, 5, 4, 5, 6, 4, 5, 5, 5, 6, 5, 5, 4, 6, 5, 5, 5, 5, 5, 5, 4, 5, 6, 6, 5, 6, 4, 5, 6, 5, 6, 6, 5, 4, 5, 5, 5, 5, 5 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

a(n) = length of n-th row in table A247765. - Reinhard Zumkeller, Sep 25 2014

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..100

EXAMPLE

a(16) = 5 because 16/17 = 1/2 + 1/3 + 1/10 + 1/128 + 1/32640.

PROG

(PARI) A100678(n)={ my(x = n/(n+1), nb = 1); while(x -= 1/ceil(1/x), nb++); nb} \\ Michel Marcus, Aug 12 2013, minor edits by M. F. Hasler, Sep 25 2014

(Haskell)

a100678 = length . a247765_row -- Reinhard Zumkeller, Sep 25 2014

CROSSREFS

Cf. A100695.

Cf. A247765.

Sequence in context: A003434 A330808 A097849 * A026834 A071335 A176839

Adjacent sequences:  A100675 A100676 A100677 * A100679 A100680 A100681

KEYWORD

nonn

AUTHOR

Pahikkala Jussi, Dec 06 2004

EXTENSIONS

More terms from M. F. Hasler, Sep 25 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 8 20:14 EST 2021. Contains 341953 sequences. (Running on oeis4.)