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.

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

Table of values

n a(n)
1 0
2 1
3 3
4 6
5 11
6 20
7 36
8 65
9 118
10 215
11 393
12 721
13 1329
14 2463
15 4589
16 8590
17 16142
18 30434
19 57549
20 109114
21 207388
22 395045
23 754027
24 1441971
25 2762764
26 5303466
27 10200385
28 19656528
29 37948281
30 73384080
31 142115376
32 275551755
33 534790472
34 1038702980
35 2018626772
36 3924923937
37 7634733312

List of values

[0, 1, 3, 6, 11, 20, 36, 65, 118, 215, 393, 721, 1329, 2463, 4589, 8590, 16142, 30434, 57549, 109114, 207388, 395045, 754027, 1441971, 2762764, 5303466, 10200385, 19656528, 37948281, 73384080, 142115376, 275551755, 534790472, 1038702980, 2018626772, 3924923937, 7634733312]