A080622 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

A080622

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.

1, 1, 2, 6, 16, 15, 9 (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 = 50.`
	LINKS	`Table of n, a(n) for n=0..6.` `Mark Longridge, God's Algorithm Calculations for Rubik's Cube...`
	CROSSREFS	`Cf. A080601, A080614, etc.` `Sequence in context: A356370 A355096 A036046 * A082374 A085226 A260376` `Adjacent sequences: A080619 A080620 A080621 * A080623 A080624 A080625`
	KEYWORD	`nonn,fini,full`
	AUTHOR	`N. J. A. Sloane, Feb 26 2003`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 30 12:49 EST 2023. Contains 359945 sequences. (Running on oeis4.)