Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A080625
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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, 1, 3, 10, 37, 93, 166, 147, 89, 21 (list; graph; listen)
OFFSET

0,3

COMMENT

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

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.

Adjacent sequences: A080622 A080623 A080624 this_sequence A080626 A080627 A080628

Sequence in context: A081921 A010373 A104603 this_sequence A138807 A105284 A119244

KEYWORD

nonn,fini,full

AUTHOR

njas, Feb 26 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research