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.

A291876 Consider the graph with one central vertex connected to three outer vertices (a star graph). Then, a(n) is the minimum number of moves required to transfer a stack of n pegs from one outer vertex to another outer vertex, moving pegs to adjacent vertices, following the rules of the Towers of Hanoi.

Table of values

n a(n)
1 2
2 6
3 12
4 20
5 32
6 48
7 66
8 90
9 122
10 158
11 206
12 260
13 324
14 396
15 492
16 600
17 728
18 872
19 1034
20 1226
21 1442
22 1698
23 1986
24 2310
25 2694
26 3126
27 3612
28 4124
29 4700
30 5348
31 6116
32 6980
33 7952
34 8976
35 10128
36 11424
37 12882
38 14418
39 16146
40 18090
41 20138
42 22442
43 25034
44 27950
45 31022
46 34478
47 38366

List of values

[2, 6, 12, 20, 32, 48, 66, 90, 122, 158, 206, 260, 324, 396, 492, 600, 728, 872, 1034, 1226, 1442, 1698, 1986, 2310, 2694, 3126, 3612, 4124, 4700, 5348, 6116, 6980, 7952, 8976, 10128, 11424, 12882, 14418, 16146, 18090, 20138, 22442, 25034, 27950, 31022, 34478, 38366]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.