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 9! = 362880. Here we only use moves of types a-d.

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

Jaap Scherphuis, Puzzle Pages

Cf. A079735-A079738.

Sequence in context: A340492 A084362 A318941 * A035045 A196859 A090328

Adjacent sequences: A079733 A079734 A079735 * A079737 A079738 A079739

nonn,fini,full

N. J. A. Sloane, Feb 20 2003

approved