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 10! = 3628800. Here we use moves of all types a-f.

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

Jaap Scherphuis, Puzzle Pages

Cf. A079735-A079737.

Sequence in context: A089817 A006320 A319377 * A127741 A073965 A214940

Adjacent sequences: A079735 A079736 A079737 * A079739 A079740 A079741

nonn,fini,full

N. J. A. Sloane, Feb 20 2003

approved