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.

A341582 Number of simple moves of the smallest disk in the solution to the Towers of Hanoi exchanging disks puzzle with 3 pegs and n disks.

Table of values

n a(n)
0 0
1 1
2 2
3 4
4 6
5 12
6 22
7 42
8 76
9 142
10 262
11 488
12 902
13 1674
14 3100
15 5750
16 10654
17 19752
18 36606
19 67858
20 125772
21 233134
22 432118
23 800968
24 1484630
25 2751866
26 5100732
27 9454534
28 17524526
29 32482792
30 60208782
31 111600642
32 206858476
33 383424702
34 710700742
35 1317326728
36 2441744422

List of values

[0, 1, 2, 4, 6, 12, 22, 42, 76, 142, 262, 488, 902, 1674, 3100, 5750, 10654, 19752, 36606, 67858, 125772, 233134, 432118, 800968, 1484630, 2751866, 5100732, 9454534, 17524526, 32482792, 60208782, 111600642, 206858476, 383424702, 710700742, 1317326728, 2441744422]