id:A063676 - OEIS Search Results

Search: id:A063676

Displaying 1-1 of 1 results found.

page 1

a(1) = 1 and for n > 1 let a(n) = a(n-1) + m, where m is the arithmetic mean of the largest subset of all predecessors such that m is an integer and m is maximal.

+0
3

1, 2, 4, 7, 11, 16, 24, 33, 46, 62, 78, 106, 140, 184, 235, 302, 391, 487, 612, 768, 943, 1155, 1367, 1698, 2075, 2513, 3023, 3649, 4386, 5286, 6306, 7544, 8936, 10408, 12255, 14102, 16590, 19426, 22902, 26902, 31345, 36634, 42707, 49486, 57463 (list; graph; listen)

	OFFSET	`1,2`
	EXAMPLE	`The arithmetic mean of the first 7 elements is (1 + 2 + 4 + 7 + 11 + 16 + 24) / 7 = 65 / 7; this is not an integer. But skipping a(5) = 11 yields m = 54 / 6 = 9, so we have a(8) = a(7) + m = 24 + 9 = 33.`
	CROSSREFS	`A063677, A063678.` `Sequence in context: A005253 A129339 A011912 this_sequence A099385 A120118 A108895` `Adjacent sequences: A063673 A063674 A063675 this_sequence A063677 A063678 A063679`
	KEYWORD	`nice,nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 28 2001`

page 1

Search completed in 0.002 seconds

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.

AT&T Labs Research