id:A080622 - OEIS Search Results

Search: id:A080622

Displaying 1-1 of 1 results found.

page 1

Consider 3 X 3 X 3 Rubik cube, but only allow the 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, 2, 6, 16, 15, 9 (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 = 50.`
	LINKS	`Mark Longridge, God's Algorithm Calculations for Rubik's Cube...`
	CROSSREFS	`Cf. A080601, A080614, etc.` `Sequence in context: A009487 A009806 A036046 this_sequence A082374 A085226 A071522` `Adjacent sequences: A080619 A080620 A080621 this_sequence A080623 A080624 A080625`
	KEYWORD	`nonn,fini,full`
	AUTHOR	`njas, Feb 26 2003`

page 1

Search completed in 0.004 seconds

Last modified September 7 23:08 EDT 2008. Contains 143486 sequences.

AT&T Labs Research