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.

Previous Showing 11-11 of 11 results.

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

Original entry on oeis.org

0, 1, 1, 2, 2, 4, 5, 6, 6, 12, 17, 21, 23, 25, 26, 27, 27, 54, 80, 105, 128, 149, 166, 178, 184, 190, 195, 199, 201, 203, 204, 205, 205, 410, 614, 817, 1018, 1217, 1412, 1602, 1786, 1964, 2130, 2279, 2407, 2512, 2592, 2646, 2673, 2700, 2726, 2751, 2774, 2795, 2812, 2824, 2830
Offset: 1

Views

Author

Petros Hadjicostas, Nov 13 2019

Keywords

Crossrefs

Programs

  • Maple
    a := proc(n) option remember;
    `if`(n < 3, [0, 1][n], a(n - 1) + a(2^ceil(log[2](n - 1)) + 2 - n)); end proc;
    seq(a(n), n = 1..50); #

Formula

2^a(n) = A110428(n).
Previous Showing 11-11 of 11 results.