Now is the time of year when we ask all users of the OEIS for their annual support.
Click here to donate
to the OEIS Foundation using PayPal or in other ways.
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 4961250. Here we consider a move to be a quarter turn of a disc.
Table of n, a(n) for n=0..23.
Jaap Scherphuis, Puzzle Pages
Sequence in context: A162036 A232534 A062422 * A131045 A182555 A026721
Adjacent sequences: A079861 A079862 A079863 * A079865 A079866 A079867
N. J. A. Sloane, Feb 21 2003