id:A100695 - OEIS Search Results

Search: id:A100695

Displaying 1-1 of 1 results found.

page 1

Largest denominator used in the Egyptian fraction representation of n/(n + 1) by the greedy algorithm.

+0
1

2, 6, 4, 20, 3, 42, 24, 18, 15, 231, 12, 156, 231, 10, 240, 32640, 9, 342, 180, 126, 99, 34362, 8, 600, 312, 216, 168, 24360, 120, 633759288, 96, 88, 16728, 9240, 72, 6808, 5016, 6552, 60, 28536, 7, 1806, 924, 630, 483, 779730, 336, 294, 138075, 238, 79716 (list; graph; listen)

	OFFSET	`1,1`
	EXAMPLE	`a(16) = 32640 because 16/17 = 1/2+1/3+1/10+1/128+1/32640`
	CROSSREFS	`Cf. A100678.` `Sequence in context: A065350 A063427 A066092 this_sequence A100140 A009262 A127699` `Adjacent sequences: A100692 A100693 A100694 this_sequence A100696 A100697 A100698`
	KEYWORD	`nonn`
	AUTHOR	`John W. Layman (layman(AT)math.vt.edu), Dec 08 2004`

page 1

Search completed in 0.002 seconds

Last modified November 23 17:09 EST 2009. Contains 167438 sequences.

AT&T Labs Research