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.

A218543 Number of times when an odd number is encountered, when going from 2^(n+1)-1 to (2^n)-1 using the iterative process described in A071542.

Table of values

n a(n)
0 0
1 1
2 1
3 2
4 3
5 6
6 9
7 18
8 31
9 54
10 93
11 167
12 306
13 574
14 1088
15 2081
16 3998
17 7696
18 14792
19 28335
20 54049
21 102742
22 194948
23 369955
24 703335
25 1340834
26 2563781
27 4915378
28 9444799
29 18180238
30 35047841
31 67660623
32 130806130
33 253252243
34 491034479
35 953404380
36 1853513715
37 3607440034

List of values

[0, 1, 1, 2, 3, 6, 9, 18, 31, 54, 93, 167, 306, 574, 1088, 2081, 3998, 7696, 14792, 28335, 54049, 102742, 194948, 369955, 703335, 1340834, 2563781, 4915378, 9444799, 18180238, 35047841, 67660623, 130806130, 253252243, 491034479, 953404380, 1853513715, 3607440034]