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!)
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. 18
1, 3, 5, 8, 13, 21, 23, 13, 5, 3, 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 = 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

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 August 4 13:36 EDT 2020. Contains 336201 sequences. (Running on oeis4.)