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 8! = 40320. Here we only use moves of types a-c.

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

Jaap Scherphuis, Puzzle Pages

Cf. A079736-A079738.

Sequence in context: A055244 A089068 A018180 * A050243 A285262 A024505

Adjacent sequences: A079732 A079733 A079734 * A079736 A079737 A079738

nonn,fini,full

N. J. A. Sloane, Feb 20 2003

approved