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.

A341581 Number of steps needed to move the largest disk out from a stack of n disks in the Towers of Hanoi exchanging disks puzzle with 3 pegs.

Table of values

n a(n)
0 0
1 1
2 2
3 5
4 10
5 20
6 37
7 70
8 130
9 243
10 450
11 836
12 1549
13 2874
14 5326
15 9875
16 18302
17 33928
18 62885
19 116566
20 216058
21 400483
22 742314
23 1375932
24 2550365
25 4727266
26 8762262
27 16241395
28 30104390
29 55800320
30 103429237
31 191712350
32 355350370
33 658663363
34 1220872210
35 2262960276

List of values

[0, 1, 2, 5, 10, 20, 37, 70, 130, 243, 450, 836, 1549, 2874, 5326, 9875, 18302, 33928, 62885, 116566, 216058, 400483, 742314, 1375932, 2550365, 4727266, 8762262, 16241395, 30104390, 55800320, 103429237, 191712350, 355350370, 658663363, 1220872210, 2262960276]