A050046 -id:A050046 - cp's OEIS frontend

A050034 a(n) = a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.

1, 1, 3, 4, 5, 6, 7, 10, 14, 15, 16, 19, 23, 28, 34, 41, 51, 52, 53, 56, 60, 65, 71, 78, 88, 102, 117, 133, 152, 175, 203, 237, 278, 279, 280, 283, 287, 292, 298, 305, 315, 329, 344, 360, 379, 402, 430, 464

Offset: 1

Clark Kimberling

nonn

Ivan Neretin, Table of n, a(n) for n = 1..8193

Cf. similar sequences with different initial conditions: A050026 (1,1,1); A050030 (1,1,2); this sequence (1,1,3); A050038 (1,1,4); A050042 (1,2,1); A050046 (1,2,2); A050050 (1,2,3); A050054 (1,2,4); A050058 (1,3,1); A050062 (1,3,2); A050066 (1,3,3); A050070 (1,3,4).

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

lista(nn) = {nn = max(nn, 3); my(va = vector(nn)); va[1] = 1; va[2] = 1; va[3] = 3; for(n=4, nn, va[n] = va[n-1] + va[n - 1 - 2^logint(n-2, 2)]); va; } \\ Petros Hadjicostas, May 10 2020

Name edited by Petros Hadjicostas, May 10 2020

A050038 a(n) = a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.

Original entry on oeis.org

1, 1, 4, 5, 6, 7, 8, 12, 17, 18, 19, 23, 28, 34, 41, 49, 61, 62, 63, 67, 72, 78, 85, 93, 105, 122, 140, 159, 182, 210, 244, 285, 334, 335, 336, 340, 345, 351, 358, 366, 378, 395, 413, 432, 455, 483, 517, 558

Offset: 1

Clark Kimberling

nonn

Ivan Neretin, Table of n, a(n) for n = 1..8193

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

Fold[Append[#1, #1[[-1]] + #1[[#2]]] &, {1, 1, 4}, Flatten@Table[k, {n, 5}, {k, 2^n}]] (* Ivan Neretin, Sep 08 2015 *)

lista(nn) = {nn = max(nn, 3); my(va = vector(nn)); va[1] = 1; va[2] = 1; va[3] = 4; for(n=4, nn, va[n] = va[n-1] + va[n - 1 - 2^logint(n-2, 2)]); va; } \\ Petros Hadjicostas, May 15 2020

Name edited by Petros Hadjicostas, May 15 2020

A050050 a(n) = a(n-1)+a(m), where m=n-1-2^p and 2^p= 4.

Original entry on oeis.org

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, 120, 137, 156, 178, 204, 236, 275, 323, 324, 326, 329, 333, 339, 346, 355, 367, 383, 400, 419, 441, 467, 499, 538

Offset: 1

Clark Kimberling

nonn

Ivan Neretin, Table of n, a(n) for n = 1..8193

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

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

cp's OEIS Frontend

A050034 a(n) = a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 3.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A050038 a(n) = a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 4.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Extensions

A050050 a(n) = a(n-1)+a(m), where m=n-1-2^p and 2^p= 4.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica