Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A079766
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A079766 Number of positions that are exactly n moves from the starting position in the Dino Cube puzzle. +0
1
2, 32, 320, 2816, 23424, 180084, 1227084, 6167660, 10926002, 1429972, 1004 (list; graph; listen)
OFFSET

0,1

COMMENT

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

Jaap Scherphuis, Puzzle Pages

CROSSREFS

Sequence in context: A053053 A053054 A035602 this_sequence A053065 A091707 A060868

Adjacent sequences: A079763 A079764 A079765 this_sequence A079767 A079768 A079769

KEYWORD

nonn,fini,full

AUTHOR

njas, Feb 20 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 8 08:06 EDT 2008. Contains 143486 sequences.


AT&T Labs Research