id:A058329 - OEIS Search Results

Search: id:A058329

Displaying 1-1 of 1 results found.

page 1

a(n) is smallest positive integer > a(n-1) such that (sum{k=1 to n}[a(k)]) divides (product{k=1 to n}[a(k)])*(sum{k=1 to n}[1/a(k)]).

+0
1

1, 2, 4, 8, 13, 17, 52, 59, 71, 85, 104, 112, 148, 156, 192, 224, 264, 280, 284, 290, 322, 336, 356, 364, 372, 420, 434, 438, 442, 450, 460, 465, 503, 504, 516, 521, 523, 558, 570, 572, 578, 580, 598, 612, 624, 636, 656, 667, 669, 708, 711, 719, 725, 731, 744 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	EXAMPLE	`a(5) = 13 because 13 is the smallest positive integer m, m > a(4) = 8, such that (1 + 2 + 4 + 8 + m) divides 1 * 2 * 4 * 8 * m * (1 + 1/2 + 1/4 + 1/8 + 1/m).`
	CROSSREFS	`Sequence in context: A018442 A018335 A030058 this_sequence A037380 A030503 A084684` `Adjacent sequences: A058326 A058327 A058328 this_sequence A058330 A058331 A058332`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet Dec 12 2000`

page 1

Search completed in 0.002 seconds

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.

AT&T Labs Research