The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
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
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
Jaap Scherphuis, Puzzle Pages
CROSSREFS
Sequence in context: A224058 A073394 A038846 * A079768 A053410 A225591
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 | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 11 06:21 EDT 2024. Contains 373289 sequences. (Running on oeis4.)