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.

A160002 Number of moves needed to solve 4-peg Tower of Hanoi Puzzle with n disks.

Table of values

n a(n)
0 0
1 3
2 10
3 19
4 34
5 57
6 88
7 123
8 176
9 253
10 342
11 449
12 572
13 749
14 980
15 1261
16 1560
17 1903
18 2328
19 2889
20 3562
21 4377
22 5276
23 6247

List of values

[0, 3, 10, 19, 34, 57, 88, 123, 176, 253, 342, 449, 572, 749, 980, 1261, 1560, 1903, 2328, 2889, 3562, 4377, 5276, 6247]