Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
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 44100. Here we consider a move to be a quarter turn of a disc.
Table of n, a(n) for n=0..15.
Jaap Scherphuis, Puzzle Pages
Sequence in context: A118871 A019494 A192886 * A080617 A080628 A225127
Adjacent sequences: A079841 A079842 A079843 * A079845 A079846 A079847
N. J. A. Sloane, Feb 21 2003