A080614 Consider a 3 X 3 X 3 Rubik's Cube, but allow only the moves T2, D2, F2; sequence gives number of positions that are exactly n moves from the start.

1, 3, 5, 8, 13, 21, 23, 13, 5, 3, 1

Offset

0,2

Comments

Not every position can be reached using this restricted set of moves. Total number of positions that can be reached = 96.

Links

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

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

Crossrefs

Cf. A080601, A080615, etc.

Sequence in context: A265068 A227547 A163685 * A079122 A265069 A265070

Adjacent sequences: A080611 A080612 A080613 * A080615 A080616 A080617

Keyword

nonn,fini,full

Author

N. J. A. Sloane, Feb 26 2003

Status

approved