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.

A079762 Number of positions that are exactly n moves from the starting position in the 2 X 2 X 2 Rubik cube puzzle.

Original entry on oeis.org

1, 6, 27, 120, 534, 2256, 8969, 33058, 114149, 360508, 930588, 1350852, 782536, 90280, 276
Offset: 0

Views

Author

N. J. A. Sloane, Feb 20 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.
A puzzle in the Rubik cube family. The total number of distinct positions is 3674160. A half-turn is considered to be two moves.

Crossrefs