|
Search: id:A079875
|
|
|
| A079875 |
|
Number of positions that are exactly n moves from the starting position in the Lights Out 2000 puzzle. |
|
+0
1
|
|
| 1, 25, 325, 2900, 19850, 110630, 520948, 2125078, 7644164, 24561916, 71147752, 186876765, 446015084, 964537892, 1872111656, 3203446007, 4709112417, 5767439109, 5710406148, 4433675458, 2590026921, 1073252214, 279734731, 36143633, 2147985
(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.
A puzzle in the Rubik cube family. The total number of distinct positions is 31381059609.
|
|
LINKS
|
Jaap Scherphuis, Puzzle Pages
|
|
CROSSREFS
|
Sequence in context: A000448 A124980 A000446 this_sequence A010977 A022589 A094730
Adjacent sequences: A079872 A079873 A079874 this_sequence A079876 A079877 A079878
|
|
KEYWORD
|
nonn,fini,full
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Feb 21 2003
|
|
|
Search completed in 0.002 seconds
|
