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.

A213709 Number of steps to go 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 1
2 2
3 3
4 5
5 9
6 17
7 30
8 54
9 98
10 179
11 330
12 614
13 1150
14 2162
15 4072
16 7678
17 14496
18 27418
19 51979
20 98800
21 188309
22 359889
23 689649
24 1325006
25 2552031
26 4926589
27 9529551
28 18463098
29 35815293
30 69534171
31 135069124
32 262448803
33 510047416
34 991381433
35 1927317745
36 3747885517

List of values

[1, 1, 2, 3, 5, 9, 17, 30, 54, 98, 179, 330, 614, 1150, 2162, 4072, 7678, 14496, 27418, 51979, 98800, 188309, 359889, 689649, 1325006, 2552031, 4926589, 9529551, 18463098, 35815293, 69534171, 135069124, 262448803, 510047416, 991381433, 1927317745, 3747885517]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.