A080615 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A080615

Consider 3 X 3 X 3 Rubik cube, but only allow the moves T2, D2, F2, B2; sequence gives number of positions that are exactly n moves from the start.

1

1, 4, 10, 24, 53, 64, 31, 4, 1

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

OFFSET

0,2

COMMENTS

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

LINKS

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

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

CROSSREFS

Cf. A080601, A080614, etc.

Sequence in context: A107659 A162588 A280541 * A173729 A340569 A097976

Adjacent sequences: A080612 A080613 A080614 * A080616 A080617 A080618

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane, Feb 26 2003

STATUS

approved