A079767 - OEIS

This site is supported by donations to The OEIS Foundation.

Invitation: celebrating 50 years of OEIS, 250000 sequences, and Sloane's 75th, there will be a conference at DIMACS, Rutgers, Oct 9-10 2014.

A079767

Number of positions that are exactly n moves from the starting position in the Dino Cube puzzle.

1, 16, 160, 1408, 11712, 90912, 640192, 3740838, 11138597, 4313963, 20577 (list; graph; refs; listen; history; text; internal format)

	OFFSET	`0,2`
	COMMENTS	`This is the number of positions that can be reached in n moves from the start, but which cannot be reached in fewer than n moves.` `There are two starting positions, mirror images of each other. Sequence gives total number of positions at distance n from one of the starting positions.` `A puzzle in the Rubik cube family. The total number of distinct positions is 19958400.`
	LINKS	`Table of n, a(n) for n=0..10.` `Jaap Scherphuis, Puzzle Pages`
	CROSSREFS	`Sequence in context: A224058 A073394 A038846 * A079768 A053410 A225591` `Adjacent sequences: A079764 A079765 A079766 * A079768 A079769 A079770`
	KEYWORD	`nonn,fini,full`
	AUTHOR	`N. J. A. Sloane, Feb 20 2003`
	STATUS	`approved`

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

Last modified July 30 20:52 EDT 2014. Contains 245075 sequences.