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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A151851 a(0)=0; a(1)=0; a(2)=0; for n>=3 if n=2^i + j with 0<=j<2^i then a(n)=a(j) + 2*a(j + 1) except we add 1 if j=2^i-1. 1

%I #2 Mar 30 2012 16:51:07

%S 0,0,0,1,0,0,2,2,0,0,2,1,0,4,6,3,0,0,2,1,0,4,6,2,0,4,4,1,8,16,12,4,0,

%T 0,2,1,0,4,6,2,0,4,4,1,8,16,12,3,0,4,4,1,8,16,10,2,8,12,6,17,40,40,20,

%U 5,0,0,2,1,0,4,6,2,0,4,4,1,8,16,12,3,0,4,4,1,8,16,10,2,8,12,6,17,40,40,20,4

%N a(0)=0; a(1)=0; a(2)=0; for n>=3 if n=2^i + j with 0<=j<2^i then a(n)=a(j) + 2*a(j + 1) except we add 1 if j=2^i-1.

%F I would very much like a g.f. for this sequence!

%Y Cf. A151843-A151874.

%K nonn

%O 0,7

%A _N. J. A. Sloane_, Jul 17 2009

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.

Last modified March 5 05:07 EST 2024. Contains 370537 sequences. (Running on oeis4.)