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!)
A050059 a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4. 11

%I #9 Sep 07 2015 08:16:37

%S 1,3,1,4,8,11,15,26,52,55,59,70,96,151,221,372,744,747,751,762,788,

%T 843,913,1064,1436,2183,2945,3788,4852,7035,10823,17858,35716,35719,

%U 35723,35734,35760,35815,35885,36036,36408,37155,37917

%N a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.

%H Ivan Neretin, <a href="/A050059/b050059.txt">Table of n, a(n) for n = 1..8193</a>

%t Fold[Append[#1, #1[[-1]] + #1[[#2]]] &, {1, 3, 1}, Flatten@Table[2 k, {n, 5}, {k, 2^n}]] (* _Ivan Neretin_, Sep 07 2015 *)

%Y Cf. A050027, A050031, A050035, A050039, A050043, A050047, A050051, A050055, A050063, A050067, A050071 (similar, but with different initial conditions).

%K nonn

%O 1,2

%A _Clark Kimberling_

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 August 22 18:05 EDT 2024. Contains 375369 sequences. (Running on oeis4.)