0,3

Not every position can be reached using this restricted set of moves. Number of inequivalent positions that can be reached = 50.

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

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

Cf. A080601, A080614, etc.

Sequence in context: A356370 A355096 A036046 * A082374 A085226 A260376

Adjacent sequences: A080619 A080620 A080621 * A080623 A080624 A080625

nonn,fini,full

N. J. A. Sloane, Feb 26 2003

approved