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!)
A080625 Consider 3 X 3 X 3 Rubik cube, but only allow the anti-slice group to act; 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, 3, 10, 37, 93, 166, 147, 89, 21 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Not every position can be reached using this restricted set of moves. Number of inequivalent positions that can be reached = 568. This is for 2q moves.

REFERENCES

Jerry Bryan, posting to Cube Lovers List, May 19 1995 and May 21 1995.

LINKS

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

Alan Bawden, Cube Lovers Archive, Part 15

Alan Bawden, Cube Lovers Archive, Part 16

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

CROSSREFS

Cf. A080601, A080614, etc.

Sequence in context: A010373 A322726 A104603 * A289615 A138807 A149043

Adjacent sequences:  A080622 A080623 A080624 * A080626 A080627 A080628

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 6 17:06 EDT 2020. Contains 336255 sequences. (Running on oeis4.)