0,2

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 3674160. A half-turn is considered to be two moves.

Table of n, a(n) for n=0..14.

Mark Longridge, God's Algorithm Calculations for Rubik's Cube...

Jaap Scherphuis, Puzzle Pages

Cf. A079761, A152169.

Sequence in context: A265943 A080620 A080627 * A175716 A178935 A249792

Adjacent sequences: A079759 A079760 A079761 * A079763 A079764 A079765

nonn,fini,full

N. J. A. Sloane, Feb 20 2003

approved