cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A005452 Number of positions that the 3 X 3 X 3 Rubik cube puzzle can be in after exactly n moves, up to equivalence under the full group of order 48 of the cube and with a half-turn is considered to be 2 moves.

Original entry on oeis.org

1, 1, 5, 25, 219, 1978, 18395, 171529, 1601725, 14956266, 139629194, 1303138445, 12157779067, 113382522382, 1056867697737, 9843661720634, 91532722388023, 846837132071729, 7668156860181597
Offset: 0

Views

Author

N. J. A. Sloane, Feb 25 2003

Keywords

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.
The total number of inequivalent positions is 901083404981813616. - Jerry Bryan, Mar 03 2003

References

  • Robert G. Bryan (Jerry Bryan), postings to Cube Lovers List, Feb 04, 1995 and Oct 26, 1998.

Crossrefs

This is A080602 reduced by action of group of order 48. Cf. A080583, A080601, A080638.

Extensions

Added a(13)-a(18). This is based on a great deal of work by a large number of people; full links and credit are on cube20.org/qtm. The numbers were calculated by combining the God's number counts on the main page with the symmetric solution counts on the symmetry page. - Tomas Rokicki, Sep 01 2014