id:A080614 - OEIS Search Results

Search: id:A080614

Displaying 1-1 of 1 results found.

page 1

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

+0
19

1, 3, 5, 8, 13, 21, 23, 13, 5, 3, 1 (list; graph; listen)

	OFFSET	`0,2`
	COMMENT	`Not every position can be reached using this restricted set of moves. Total number of positions that can be reached = 96.`
	LINKS	`Mark Longridge, God's Algorithm Calculations for Rubik's Cube...`
	CROSSREFS	`Cf. A080601, A080615, etc.` `Sequence in context: A035421 A035424 A099351 this_sequence A079122 A071679 A020701` `Adjacent sequences: A080611 A080612 A080613 this_sequence A080615 A080616 A080617`
	KEYWORD	`nonn,fini,full`
	AUTHOR	`njas, Feb 26 2003`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.