|
Search: id:A080625
|
|
|
| A080625 |
|
Consider 3 X 3 X 3 Rubik cube, but only allow the anti-slice group to act; sequence gives number of positions that are exactly n moves from the start, up to equivalence under the full group of order 48 of the cube. |
|
+0
1
|
| |
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Not every position can be reached using this restricted set of moves. Number of inequivalent positions that can be reached = 568. This is for 2q moves.
|
|
REFERENCES
|
Jerry Bryan, posting to Cube Lovers List, May 19 1995 and May 21 1995.
|
|
LINKS
|
Alan Bawden, Cube Lovers Archive, Part 15
Alan Bawden, Cube Lovers Archive, Part 16
Mark Longridge, God's Algorithm Calculations for Rubik's Cube...
|
|
CROSSREFS
|
Cf. A080601, A080614, etc.
Sequence in context: A165792 A010373 A104603 this_sequence A138807 A149043 A151315
Adjacent sequences: A080622 A080623 A080624 this_sequence A080626 A080627 A080628
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 26 2003
|
|
|
Search completed in 0.002 seconds
|
