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

%I #15 Sep 08 2015 08:13:56

%S 1,2,3,4,6,7,9,12,16,17,19,22,26,32,39,48,60,61,63,66,70,76,83,92,104,

%T 120,137,156,178,204,236,275,323,324,326,329,333,339,346,355,367,383,

%U 400,419,441,467,499,538

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

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

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

%Y Cf. similar sequences with different initial conditions: A050026 (1,1,1), A050030 (1,1,2), A050034 (1,1,3), A050038 (1,1,4), A050042 (1,2,1), A050046 (1,2,2), A050054 (1,2,4), A050058 (1,3,1), A050062 (1,3,2), A050066 (1,3,3), A050070 (1,3,4).

%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 April 30 05:51 EDT 2024. Contains 372119 sequences. (Running on oeis4.)