login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080632 Consider 3 X 3 X 3 Rubik cube, but consider only positions of edges; sequence gives number of positions that are exactly n moves from the start up to equivalence under the full group of order 48 of the cube. 0
1, 1, 5, 25, 215, 1886, 16902, 150442, 1326326, 11505339, 96755918, 750089528 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Total number of inequivalent positions = 851625008. This count is "with centers".

LINKS

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

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

CROSSREFS

Cf. A080601, A080614, etc.

Sequence in context: A193939 A229810 A080631 * A245166 A144575 A005452

Adjacent sequences:  A080629 A080630 A080631 * A080633 A080634 A080635

KEYWORD

nonn,fini

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 13 19:25 EST 2018. Contains 317149 sequences. (Running on oeis4.)