A080615 - OEIS

This site is supported by donations to The OEIS Foundation.

A080615

Consider 3 X 3 X 3 Rubik cube, but only allow the moves T2, D2, F2, B2; sequence gives number of positions that are exactly n moves from the start.

1, 4, 10, 24, 53, 64, 31, 4, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,2`
	COMMENTS	`Not every position can be reached using this restricted set of moves. Total number of positions that can be reached = 192.`
	LINKS	`Mark Longridge, God's Algorithm Calculations for Rubik's Cube...`
	CROSSREFS	`Cf. A080601, A080614, etc.` `Sequence in context: A052365 A107659 A162588 * A173729 A097976 A152548` `Adjacent sequences: A080612 A080613 A080614 * A080616 A080617 A080618`
	KEYWORD	`nonn,fini,full`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Feb 26 2003`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 00:09 EST 2012. Contains 205978 sequences.