id:A080615 - OEIS Search Results

Search: id:A080615

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, B2; sequence gives number of positions that are exactly n moves from the start.

+0
2

1, 4, 10, 24, 53, 64, 31, 4, 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 = 192.`
	LINKS	`Mark Longridge, God's Algorithm Calculations for Rubik's Cube...`
	CROSSREFS	`Cf. A080601, A080614, etc.` `Sequence in context: A052365 A107659 A162588 this_sequence A097976 A152548 A090855` `Adjacent sequences: A080612 A080613 A080614 this_sequence A080616 A080617 A080618`
	KEYWORD	`nonn,fini,full`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Feb 26 2003`

page 1

Search completed in 0.002 seconds

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.