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.

A255063 Number of times an evil number 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 1
1 0
2 1
3 2
4 2
5 5
6 7
7 14
8 24
9 52
10 84
11 173
12 290
13 586
14 1038
15 2025
16 3740
17 7177
18 13498
19 25832
20 49027
21 93918
22 179291
23 344128
24 660058
25 1270590
26 2447944
27 4728357
28 9145214
29 17718039
30 34365068
31 66717630
32 129619518
33 251953756
34 489964171
35 953141850
36 1854911347

List of values

[1, 0, 1, 2, 2, 5, 7, 14, 24, 52, 84, 173, 290, 586, 1038, 2025, 3740, 7177, 13498, 25832, 49027, 93918, 179291, 344128, 660058, 1270590, 2447944, 4728357, 9145214, 17718039, 34365068, 66717630, 129619518, 251953756, 489964171, 953141850, 1854911347]