A100678 - OEIS

This site is supported by donations to The OEIS Foundation.

A100678

Number of the Egyptian fractions in the representation of n/(n+1) via the greedy algorithm.

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 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	EXAMPLE	`a(16) = 5 because 16/17 = 1/2+1/3+1/10+1/128+1/32640`
	CROSSREFS	`Sequence in context: A019569 A003434 A097849 * A026834 A071335 A176839` `Adjacent sequences: A100675 A100676 A100677 * A100679 A100680 A100681`
	KEYWORD	`nonn`
	AUTHOR	`Pahikkala Jussi (pahio(AT)wakkanet.fi), Dec 06 2004`

Content is available under The OEIS End-User License Agreement .

Last modified February 15 12:24 EST 2012. Contains 205785 sequences.