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.

A338089 Minimal number of moves for the cyclic variant of Hanoi's tower for 4 pegs and n disks, with the final peg three steps away.

Table of values

n a(n)
1 3
2 10
3 21
4 40
5 75
6 134
7 233
8 400
9 683
10 1166
11 1981
12 3364
13 5711
14 9690
15 16433
16 27872
17 47267
18 80150
19 135909
20 230460
21 390775

List of values

[3, 10, 21, 40, 75, 134, 233, 400, 683, 1166, 1981, 3364, 5711, 9690, 16433, 27872, 47267, 80150, 135909, 230460, 390775]