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.

A080564 Number of positions that are exactly n moves from the starting position in the Orbix Type 4 puzzle.

Original entry on oeis.org

1, 24, 30, 12, 180, 492, 735, 1460, 1101, 60
Offset: 0

Views

Author

N. J. A. Sloane, Feb 21 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 4096.

Crossrefs