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.

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

Original entry on oeis.org

1, 1, 3, 5, 10, 12, 18, 12, 10, 5, 3, 1, 1
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 82. Here positions differing by rotations or reflections are considered the same.

Crossrefs