Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 4500 articles have referenced us, often saying "we would not have discovered this result without 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 588. Here positions differing by rotations or reflections are considered the same.
Table of n, a(n) for n=0..24.
Jaap Scherphuis, Puzzle Pages
Sequence in context: A090178 A080548 A194450 * A229093 A064985 A090631
Adjacent sequences: A080553 A080554 A080555 * A080557 A080558 A080559
N. J. A. Sloane, Feb 21 2003