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 turn of a disc by any amount.
Table of n, a(n) for n=0..12.
Jaap Scherphuis, Puzzle Pages
Sequence in context: A015645 A001216 A318484 * A290582 A346071 A076941
Adjacent sequences: A079840 A079841 A079842 * A079844 A079845 A079846
N. J. A. Sloane, Feb 21 2003