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.

A255071 Number of steps required to reach (2^n)-2 from 2^(n+1)-2 by iterating the map x -> x - (number of runs in binary representation of x).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 9
6 16
7 29
8 53
9 97
10 178
11 328
12 608
13 1134
14 2126
15 4001
16 7552
17 14292
18 27115
19 51565
20 98274
21 187657
22 358982
23 687944
24 1320793
25 2540702
26 4896919
27 9456143
28 18291753
29 35435799
30 68731296
31 133436379
32 259238717
33 503912508
34 979923792
35 1906297165
36 3709809375
37 7222584181

List of values

[1, 2, 3, 5, 9, 16, 29, 53, 97, 178, 328, 608, 1134, 2126, 4001, 7552, 14292, 27115, 51565, 98274, 187657, 358982, 687944, 1320793, 2540702, 4896919, 9456143, 18291753, 35435799, 68731296, 133436379, 259238717, 503912508, 979923792, 1906297165, 3709809375, 7222584181]