login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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

%I #6 Mar 11 2014 01:32:24

%S 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,

%T -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,

%U 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

%N 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).

%F a(n) = 1 - A104145(n). - _Leroy Quet_, Apr 22 2008

%e Starting with a(1) = 1 instead gets sequence A104145.

%Y Cf. A104145.

%K easy,sign

%O 1,7

%A _Leroy Quet_, Apr 15 2008

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 10:53 EDT 2024. Contains 371936 sequences. (Running on oeis4.)