This site is supported by donations to The OEIS Foundation.



Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079767 Number of positions that are exactly n moves from the starting position in the Dino Cube puzzle. 0
1, 16, 160, 1408, 11712, 90912, 640192, 3740838, 11138597, 4313963, 20577 (list; graph; refs; listen; history; text; internal format)



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.


Table of n, a(n) for n=0..10.

Jaap Scherphuis, Puzzle Pages


Sequence in context: A224058 A073394 A038846 * A079768 A053410 A225591

Adjacent sequences:  A079764 A079765 A079766 * A079768 A079769 A079770




N. J. A. Sloane, Feb 20 2003



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

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

Last modified December 18 22:55 EST 2014. Contains 252174 sequences.