|
| |
|
|
A080561
|
|
Number of positions that are exactly n moves from the starting position in the Orbix Type 1 puzzle.
|
|
0
| |
|
|
1, 1, 3, 5, 10, 12, 18, 12, 10, 5, 3, 1, 1
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| This is the number of positions that can be reached in n moves from the start, but which cannot be reached in fewer than n moves.
A puzzle in the Rubik cube family. The total number of distinct positions is 82. Here positions differing by rotations or reflections are considered the same.
|
|
|
LINKS
| Jaap Scherphuis, Puzzle Pages
|
|
|
CROSSREFS
| Cf. A010928, A080560-A080564.
Sequence in context: A119133 A047389 A093661 * A007557 A034746 A080931
Adjacent sequences: A080558 A080559 A080560 * A080562 A080563 A080564
|
|
|
KEYWORD
| nonn,fini,full
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com), Feb 21 2003
|
| |
|
|
