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!)
A050071 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 #10 Sep 07 2015 08:05:07

%S 1,3,4,7,14,17,24,41,82,85,92,109,150,235,344,579,1158,1161,1168,1185,

%T 1226,1311,1420,1655,2234,3395,4580,5891,7546,10941,16832,27773,55546,

%U 55549,55556,55573,55614,55699,55808,56043,56622

%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="/A050071/b050071.txt">Table of n, a(n) for n = 1..8193</a>

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

%Y Cf. A050027, A050031, A050035, A050039, A050043, A050047, A050051, A050055, A050059, A050063, A050067 (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 March 29 08:59 EDT 2024. Contains 371268 sequences. (Running on oeis4.)