|
Search: id:A079767
|
|
|
| A079767 |
|
Number of positions that are exactly n moves from the starting position in the Dino Cube puzzle. |
|
+0
1
|
|
| 1, 16, 160, 1408, 11712, 90912, 640192, 3740838, 11138597, 4313963, 20577
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
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 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
|
Adjacent sequences: A079764 A079765 A079766 this_sequence A079768 A079769 A079770
Sequence in context: A121036 A073394 A038846 this_sequence A079768 A053410 A000811
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
njas, Feb 20 2003
|
|
|
Search completed in 0.002 seconds
|
