|
Search: id:A080560
|
|
|
| A080560 |
|
Number of positions that are exactly n moves from the starting position in the Orbix Type 1 puzzle. |
|
+0
6
|
|
| 1, 1, 3, 5, 12, 14, 24, 14, 12, 5, 3, 1, 1
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
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 96. Here positions differing by rotations are considered the same.
|
|
LINKS
|
Jaap Scherphuis, Puzzle Pages
|
|
CROSSREFS
|
Cf. A010928, A080560-A080564.
Sequence in context: A066541 A087122 A037221 this_sequence A151866 A057587 A032438
Adjacent sequences: A080557 A080558 A080559 this_sequence A080561 A080562 A080563
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 21 2003
|
|
|
Search completed in 0.002 seconds
|
