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

 

Logo

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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079766 Number of positions that are exactly n moves from the starting position in the Dino Cube puzzle. 0
2, 32, 320, 2816, 23424, 180084, 1227084, 6167660, 10926002, 1429972, 1004 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,1

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 either start.

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: A202746 A212797 A203017 * A224293 A053065 A091707

Adjacent sequences:  A079763 A079764 A079765 * A079767 A079768 A079769

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane, Feb 20 2003

STATUS

approved

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 August 20 10:38 EDT 2014. Contains 245797 sequences.