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.

A005666 Minimal number of moves for the cyclic variant of the Towers of Hanoi for 3 pegs and n disks, with the final peg two steps away.

Table of values

n a(n)
0 0
1 2
2 7
3 21
4 59
5 163
6 447
7 1223
8 3343
9 9135
10 24959
11 68191
12 186303
13 508991
14 1390591
15 3799167
16 10379519
17 28357375
18 77473791
19 211662335
20 578272255
21 1579869183
22 4316282879
23 11792304127
24 32217174015
25 88018956287
26 240472260607
27 656982433791
28 1794909388799

List of values

[0, 2, 7, 21, 59, 163, 447, 1223, 3343, 9135, 24959, 68191, 186303, 508991, 1390591, 3799167, 10379519, 28357375, 77473791, 211662335, 578272255, 1579869183, 4316282879, 11792304127, 32217174015, 88018956287, 240472260607, 656982433791, 1794909388799]