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 only use moves of types a-e.

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

Jaap Scherphuis, Puzzle Pages

Cf. A079735-A079738.

Sequence in context: A289786 A129869 A271887 * A028814 A079820 A275907

Adjacent sequences: A079734 A079735 A079736 * A079738 A079739 A079740

nonn,fini,full

N. J. A. Sloane, Feb 20 2003

approved