|
Search: id:A090576
|
|
|
| A090576 |
|
Number of configurations of the 3-dimensional 3 X 3 X 3 sliding cube puzzle that require a minimum of n moves to be reached, starting with the empty space at mid-side of one of the 12 edges of the combination cube. |
|
+0
7
|
|
| 1, 4, 12, 40, 128, 412, 1251, 4026, 12362, 39624, 120012, 379132, 1130914
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
See under A090573.
|
|
EXAMPLE
|
a(1)=4 because the empty space located at mid-edge of one of the 12 edges of the assumed initial configuration can be replaced in the first move by any of the adjacent 2 cubes from the same edge or by the adjacent mid-face cubes of the 2 faces forming this edge.
|
|
CROSSREFS
|
Cf. A090572 2 X 2 X 2 puzzle, A090573, A090574, A090575 3 X 3 X 3 puzzle with different initial configurations.
Sequence in context: A058353 A104525 A126986 this_sequence A087206 A081875 A102433
Adjacent sequences: A090573 A090574 A090575 this_sequence A090577 A090578 A090579
|
|
KEYWORD
|
fini,hard,more,nonn
|
|
AUTHOR
|
Hugo Pfoertner (hugo(AT)pfoertner.org), Jan 15 2004
|
|
|
Search completed in 0.002 seconds
|
