A080623 - OEIS

A080623

Consider 3 X 3 X 3 Rubik cube, but only allow the double slice group to act; sequence gives number of positions that are exactly n moves from the start, up to equivalence under the full group of order 48 of the cube.

1, 2, 4, 15, 25, 3

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,2

COMMENTS

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

LINKS

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

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

CROSSREFS

Cf. A080601, A080614, etc.

Sequence in context: A357692 A154906 A260299 * A196260 A073814 A181442

Adjacent sequences: A080620 A080621 A080622 * A080624 A080625 A080626

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane, Feb 26 2003

STATUS

approved