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.

A080623 Consider 3 X 3 X 3 Rubik cube, but only allow the double 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.

Original entry on oeis.org

1, 2, 4, 15, 25, 3
Offset: 0

Views

Author

N. J. A. Sloane, Feb 26 2003

Keywords

Comments

Not every position can be reached using this restricted set of moves. Number of inequivalent positions that can be reached = 50.

Crossrefs

Cf. A080601, A080614, etc.