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.

A255126 Number of times a number of the form 4n+2 is encountered when iterating from 2^(n+1)-2 to (2^n)-2 with the map x -> x - (number of runs in binary representation of x).

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 4
5 6
6 10
7 16
8 27
9 50
10 97
11 188
12 355
13 652
14 1177
15 2126
16 3886
17 7204
18 13501
19 25465
20 48192
21 91411
22 173851
23 331821
24 636035
25 1224505
26 2366662
27 4588124
28 8913418
29 17338878
30 33756650
31 65766474
32 128239805
33 250346859
34 489422205
35 958304970
36 1879145187
37 3689012737

List of values

[0, 1, 1, 2, 4, 6, 10, 16, 27, 50, 97, 188, 355, 652, 1177, 2126, 3886, 7204, 13501, 25465, 48192, 91411, 173851, 331821, 636035, 1224505, 2366662, 4588124, 8913418, 17338878, 33756650, 65766474, 128239805, 250346859, 489422205, 958304970, 1879145187, 3689012737]