A055622 -id:A055622 - cp's OEIS frontend

A290187 Minimum number of moves to rearrange a Tower of Hanoi puzzle with 3 colors. There are 3 rods with n discs in descending sizes. On the first rod there are n red discs, on the 2nd n blue discs and on the 3rd n white ones.

5, 23, 68, 168, 377, 801, 1657, 3377, 6825, 13729, 27545, 55185

Offset: 1

Bodo Zinser, Jul 23 2017

Like the known Tower of Hanoi you have 3 rods with n discs in descending sizes. But here on the first rod there are n red discs, on the 2nd n blue discs and on the 3rd n white ones.
The task is to rearrange the discs so that red ones go to rod 2, the blue ones to rod 3 and the white ones to rod 1. Sequence lists the number of minimum moves needed to rearrange the discs.
I have written a program to find the minimum moves, it might be improved for higher values.

			For n=1 the moves are 23-12-32-31-23 (meaning to move a disc from rod 2 to 3, then 1 to 2, ...).
For n=2 the moves are 31-21-23-13-13-13-12-31-31-31-32-12-12-12-31-21-21-21-23-13-13-12-31.

Cut The Knot, 3-Colors Tower of Hanoi
Bodo Zinser, Tower of Hanoi with three colors (explanation of the algorithm)
Index entries for sequences related to Towers of Hanoi

Cf. A000225, A055622 (another 3-color variant of the Towers of Hanoi).

cp's OEIS Frontend

A290187 Minimum number of moves to rearrange a Tower of Hanoi puzzle with 3 colors. There are 3 rods with n discs in descending sizes. On the first rod there are n red discs, on the 2nd n blue discs and on the 3rd n white ones.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs