The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A137412 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). 1
 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; refs; listen; history; text; internal format)
 OFFSET 1,7 LINKS FORMULA a(n) = 1 - A104145(n). - Leroy Quet, Apr 22 2008 EXAMPLE Starting with a(1) = 1 instead gets sequence A104145. CROSSREFS Cf. A104145. Sequence in context: A236074 A099916 A099917 * A025925 A240857 A109066 Adjacent sequences:  A137409 A137410 A137411 * A137413 A137414 A137415 KEYWORD easy,sign AUTHOR Leroy Quet, Apr 15 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 8 05:50 EDT 2020. Contains 336290 sequences. (Running on oeis4.)