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 239500800.
Calculated by Claude Crepeau and Thanh Vinh Nguyen.
Table of n, a(n) for n=0..13.
Jaap Scherphuis, Puzzle Pages
Sequence in context: A073394 A038846 A079767 * A053410 A225591 A197677
Adjacent sequences: A079765 A079766 A079767 * A079769 A079770 A079771
N. J. A. Sloane, Feb 20 2003