|
Search: id:A080583
|
|
|
| A080583 |
|
Number of positions that the 3 X 3 X 3 Rubik cube puzzle can be in after exactly n moves. |
|
+0
4
|
|
| 1, 18, 262, 3502, 46741, 621649, 8240087, 109043123, 1441386411, 19037866206, 251285929522, 3314574738534, 43689000394782, 575342418679410
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
This is different from the sequence giving the number of positions that can be reached in n moves from the start, but which cannot be reached in fewer than n moves (A080601).
A half-turn is considered to be a single move (rather than two moves).
The total number of positions is 901083404981813616.
Relationship with A080601: 243 = 262 - 18 - 1, 3240 = 3502 - 262, 43239 = 46741 - 3502, ...
|
|
LINKS
|
Mark Longridge, God's Algorithm Calculations for Rubik's Cube...
Rokicki, Tomas; God's Algorithm out to 13f* [From Tomas Rokicki (rokicki(AT)cs.stanford.edu), Jul 25 2009]
|
|
CROSSREFS
|
Cf. A080601, A080602.
Sequence in context: A159537 A136660 A078205 this_sequence A076693 A083445 A159740
Adjacent sequences: A080580 A080581 A080582 this_sequence A080584 A080585 A080586
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Alex Healy (ahealy(AT)fas.harvard.edu), Feb 21 2003
|
|
EXTENSIONS
|
Added a(13). Tomas Rokicki (rokicki(AT)cs.stanford.edu), Jul 25 2009
|
|
|
Search completed in 0.002 seconds
|
