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.

A218542 Number of times when an even 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 1
1 0
2 1
3 1
4 2
5 3
6 8
7 12
8 23
9 44
10 86
11 163
12 308
13 576
14 1074
15 1991
16 3680
17 6800
18 12626
19 23644
20 44751
21 85567
22 164941
23 319694
24 621671
25 1211197
26 2362808
27 4614173
28 9018299
29 17635055
30 34486330
31 67408501
32 131642673
33 256795173
34 500346954
35 973913365
36 1894371802
37 3683559071

List of values

[1, 0, 1, 1, 2, 3, 8, 12, 23, 44, 86, 163, 308, 576, 1074, 1991, 3680, 6800, 12626, 23644, 44751, 85567, 164941, 319694, 621671, 1211197, 2362808, 4614173, 9018299, 17635055, 34486330, 67408501, 131642673, 256795173, 500346954, 973913365, 1894371802, 3683559071]