login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(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

%I

%S 1,16,160,1408,11712,90912,640192,3740838,11138597,4313963,20577

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

%C 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.

%C 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.

%C A puzzle in the Rubik cube family. The total number of distinct positions is 19958400.

%H Jaap Scherphuis, <a href="http://www.jaapsch.net/puzzles/">Puzzle Pages</a>

%K nonn,fini,full

%O 0,2

%A _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 | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 9 16:14 EST 2016. Contains 278985 sequences.