id:A137412 - OEIS Search Results

Search: id:A137412

Displaying 1-1 of 1 results found.

page 1

a(1)=0. If a(m) is odd, then a(2^(m-1)+k) = a(k)-1, for all k where 1<=k<=2^(m-1). If a(m) is even, then a(2^(m-1)+k) = a(k)+1, for all k where 1<=k<=2^(m-1).

+0
2

0, 1, -1, 0, -1, 0, -2, -1, 1, 2, 0, 1, 0, 1, -1, 0, -1, 0, -2, -1, -2, -1, -3, -2, 0, 1, -1, 0, -1, 0, -2, -1, 1, 2, 0, 1, 0, 1, -1, 0, 2, 3, 1, 2, 1, 2, 0, 1, 0, 1, -1, 0, -1, 0, -2, -1, 1, 2, 0, 1, 0, 1, -1, 0, 1, 2, 0, 1, 0, 1, -1, 0, 2, 3, 1, 2, 1, 2, 0, 1, 0, 1, -1, 0, -1, 0, -2, -1, 1, 2, 0, 1, 0, 1, -1, 0, 2, 3, 1, 2, 1, 2, 0, 1, 3, 4, 2, 3, 2, 3, 1, 2, 1, 2 (list; graph; listen)

	OFFSET	`1,7`
	FORMULA	`a(n) = 1 - A104145(n). - Leroy Quet (qq-quet(AT)mindspring.com), Apr 22 2008`
	EXAMPLE	`Starting with a(1) = 1 instead gets sequence A104145.`
	CROSSREFS	`Cf. A104145.` `Sequence in context: A060575 A099916 A099917 this_sequence A025925 A109066 A079066` `Adjacent sequences: A137409 A137410 A137411 this_sequence A137413 A137414 A137415`
	KEYWORD	`easy,sign`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com), Apr 15 2008`

page 1

Search completed in 0.002 seconds

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.

AT&T Labs Research