cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

Original entry on oeis.org

1, 3, 2, 3, 6, 7, 10, 12, 15, 16, 19, 21, 24, 30, 37, 47, 59, 60, 63, 65, 68, 74, 81, 91, 103, 118, 134, 153, 174, 198, 228, 265, 312, 313, 316, 318, 321, 327, 334, 344, 356, 371, 387, 406, 427, 451, 481, 518
Offset: 1

Views

Author

Keywords

Crossrefs

Cf. similar sequences, with different initial conditions, listed in A050034.

Programs

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