id:A118065 - OEIS Search Results

Search: id:A118065

Displaying 1-1 of 1 results found.

page 1

a(1) = a(2) = 1, a(n) = smallest number greater than a(n-1) that can be written as sum of consecutive earlier terms.

+0
4

1, 1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76, 77, 78 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`Complement of A118066.`
	LINKS	`Eric Weisstein's World of Mathematics, Hofstadter Sequences`
	EXAMPLE	`a(20) = a(11) + a(10) = 11 + 10 = 21;` `a(21) = a(9) + a(8) + a(7) = 9 + 7 + 6 = 22;` `a(22) = a(12) + a(11) = 12 + 11 = 23;` `a(23) = a(13) + a(12) = 13 + 12 = 25;` `a(24) = a(10) + a(9) + a(8) = 10 + 9 + 7 = 26.`
	CROSSREFS	`Cf. A005243.` `Sequence in context: A052421 A037477 A013937 this_sequence A020661 A068937 A047592` `Adjacent sequences: A118062 A118063 A118064 this_sequence A118066 A118067 A118068`
	KEYWORD	`nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)lhsystems.com), Apr 11 2006`

page 1

Search completed in 0.002 seconds

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.

AT&T Labs Research