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!)
A080616 Consider 3 X 3 X 3 Rubik cube, but only allow the moves T2, F2, R2; sequence gives number of positions that are exactly n moves from the start. 0
1, 3, 6, 12, 24, 48, 93, 180, 315, 489, 604, 522, 250, 42, 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. Total number of positions that can be reached = 2592.

LINKS

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

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

CROSSREFS

Cf. A080601, A080614, etc.

Sequence in context: A192871 A002910 A001668 * A090572 A163876 A033893

Adjacent sequences:  A080613 A080614 A080615 * A080617 A080618 A080619

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 28 17:43 EDT 2020. Contains 337393 sequences. (Running on oeis4.)