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.

A338024 Minimal number of moves for the cyclic variant of Hanoi's tower for 4 pegs and n disks, with the final peg one step away.

Table of values

n a(n)
1 1
2 6
3 15
4 28
5 57
6 98
7 179
8 304
9 521
10 894
11 1519
12 2576
13 4381
14 7434
15 12603
16 21380
17 36265
18 61486
19 104263
20 176808
21 299797

List of values

[1, 6, 15, 28, 57, 98, 179, 304, 521, 894, 1519, 2576, 4381, 7434, 12603, 21380, 36265, 61486, 104263, 176808, 299797]