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.

A255062 Number of steps to reach 0 when starting from (2^n)-1 and iterating the map x -> x - (number of runs in binary representation of x): a(n) = A255072(A000225(n)).

Table of values

n a(n)
0 0
1 1
2 2
3 4
4 7
5 12
6 21
7 37
8 66
9 119
10 216
11 394
12 722
13 1330
14 2464
15 4590
16 8591
17 16143
18 30435
19 57550
20 109115
21 207389
22 395046
23 754028
24 1441972
25 2762765
26 5303467
27 10200386
28 19656529
29 37948282
30 73384081
31 142115377
32 275551756
33 534790473
34 1038702981
35 2018626773
36 3924923938
37 7634733313

List of values

[0, 1, 2, 4, 7, 12, 21, 37, 66, 119, 216, 394, 722, 1330, 2464, 4590, 8591, 16143, 30435, 57550, 109115, 207389, 395046, 754028, 1441972, 2762765, 5303467, 10200386, 19656529, 37948282, 73384081, 142115377, 275551756, 534790473, 1038702981, 2018626773, 3924923938, 7634733313]