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!)
A151873 a(0)=1; a(1)=1; a(2)=4; for n>=3 if n=2^i + j with 0<=j<2^i then a(n)=2*a(j) + 2*a(j + 1) except we add 1 if j=2^i-1. 1

%I #4 May 19 2020 07:26:07

%S 1,1,4,11,4,10,30,31,4,10,30,30,28,80,122,71,4,10,30,30,28,80,122,70,

%T 28,80,120,116,216,404,386,151,4,10,30,30,28,80,122,70,28,80,120,116,

%U 216,404,386,150,28,80,120,116,216,404,384,196,216,400,472,664,1240,1580,1074,311

%N a(0)=1; a(1)=1; a(2)=4; for n>=3 if n=2^i + j with 0<=j<2^i then a(n)=2*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,3

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 3 23:22 EDT 2024. Contains 372225 sequences. (Running on oeis4.)