id:A100678 - OEIS Search Results

Search: id:A100678

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

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

page 1

Search completed in 0.002 seconds

Last modified October 9 14:06 EDT 2008. Contains 144831 sequences.

AT&T Labs Research