id:A124145 - OEIS Search Results

Search: id:A124145

Displaying 1-1 of 1 results found.

page 1

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

+0
1

1, 2, 3, 5, 6, 8, 10, 16, 17, 18, 19, 22, 25, 26, 29, 32, 33, 37, 40, 41, 43, 45, 47, 48, 50, 54, 55, 57, 59, 62, 66, 67, 68, 69, 73, 75, 76, 77, 81, 83, 85, 86, 87, 95, 98, 99, 101, 105, 109, 117, 118, 120, 126, 128, 129, 131, 133, 134, 137, 139, 140, 141, 143, 146, 148 (list; graph; listen)

	OFFSET	`1,2`
	COMMENT	`This sequence is similar to the Hofstadter sequence A005243 except the decomposition into summands has to be unique.`
	LINKS	`Tobias Baumann (baumtobi(AT)students.uni-mainz.de), Dec 01 2006, Table of n, a(n) for n = 1..454`
	EXAMPLE	`a(7)=10 because 2+3+5=10 is the only way to sum up consecutive terms. 11 is not contained in the sequence because 11=5+6=1+2+3+5 has got more than one decompositions.`
	CROSSREFS	`Cf. A005243, A118065, A118164, A118166.` `Adjacent sequences: A124142 A124143 A124144 this_sequence A124146 A124147 A124148` `Sequence in context: A122493 A053873 A118053 this_sequence A104424 A028806 A028731`
	KEYWORD	`easy,nonn`
	AUTHOR	`Tobias Baumann (baumtobi(AT)students.uni-mainz.de), Dec 01 2006`

page 1

Search completed in 0.002 seconds

Last modified October 7 08:31 EDT 2008. Contains 144667 sequences.

AT&T Labs Research