login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080628 Consider 3 X 3 X 3 Rubik cube, but only allow the <U, R> group to act; sequence gives number of positions that are exactly n moves from the start. 0
1, 4, 10, 24, 58, 140, 338, 816, 1970, 4756, 11448, 27448, 65260, 154192, 360692, 827540, 1851345, 3968840, 7891990, 13659821, 18471682, 16586822, 8039455, 1511110, 47351, 87 (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 positions that can be reached = 73483200.

LINKS

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

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

CROSSREFS

Cf. A080601, A080614, etc.

Sequence in context: A192886 A079844 A080617 * A225127 A230954 A190169

Adjacent sequences:  A080625 A080626 A080627 * A080629 A080630 A080631

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane, Feb 26 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 30 03:54 EDT 2020. Contains 337434 sequences. (Running on oeis4.)