|
|
A291877
|
|
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 discs from the central vertex to an outer vertex, moving discs to adjacent vertices, following the rules of the Towers of Hanoi.
|
|
1
|
|
|
1, 4, 7, 14, 23, 32, 47, 68, 93, 120, 153, 198, 255, 318, 399, 480, 579, 700, 835, 1012, 1201, 1428
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Clarified definition and a(16)-a(18) added by Borut Lužar, Dec 11 2017
|
|
STATUS
|
approved
|
|
|
|