|
| |
|
|
A341581
|
|
Number of steps needed to move the largest disk out from a stack of n disks in the Towers of Hanoi exchanging disks puzzle with 3 pegs.
|
|
2
|
|
|
|
0, 1, 2, 5, 10, 20, 37, 70, 130, 243, 450, 836, 1549, 2874, 5326, 9875, 18302, 33928, 62885, 116566, 216058, 400483, 742314, 1375932, 2550365, 4727266, 8762262, 16241395, 30104390, 55800320, 103429237, 191712350, 355350370, 658663363, 1220872210, 2262960276
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,3
|
|
|
COMMENTS
|
Scorer, Grundy and Smith define a variation of the towers of Hanoi puzzle where the smallest disk moves freely and two disks can exchange positions when they differ in size by 1, are on different pegs, and each is topmost on its peg. The puzzle is to move a stack of n disks from one peg to another.
Stockmeyer et al. determine the shortest solution to the puzzle. a(n) is their h(n) which is the number of steps to go from n disks on peg X to the largest disk to peg Y and the others remaining on X. This arises in A341580 to go between subgraph "connection" points.
|
|
|
LINKS
|
|
|
|
FORMULA
|
a(n) = 2*a(n-1) - a(n-3) + 2*a(n-4) - 2*a(n-5).
G.f.: x * (1 + x^2 + x^3) /( (1-x) * (1 - x - x^2 - 2*x^4) ).
G.f.: -1/(1-x) + (1 + x + x^3)/(1 - x - x^2 - 2*x^4).
|
|
|
EXAMPLE
|
As a graph where each vertex is a configuration of disks on pegs and each edge is a step (as drawn by Scorer et al.),
A
/ \
*---* n=3 disks
/ \ A to D
* * steps
/ \ / \ a(3) = 5
*---B---*---*
/ \
D / \ *
/ \ / \ / \
*---C *---*
/ \ / \
* *-------* *
/ \ / \ / \ / \
*---*---*---* *---*---*---*
The recurrence using A341579 and A341580 is steps A341580(2)=3 from A to B, +1 from B to C, and A341579(1) = 1 from C to D (the whole puzzle solution in an n-2 subgraph).
|
|
|
PROG
|
(PARI) my(p=Mod('x, 'x^4-'x^3-'x^2-2)); a(n) = subst(lift(p^(n+2))\'x, 'x, 2)/2 - 1;
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn,easy
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
