|
Search: id:A061526
|
|
|
| A061526 |
|
Number of complete games of n X n tic-tac-toe. |
|
+0
5
|
|
| 1, 24, 255168, 15038733958272, 12123953291699459229254400, 317158792989363996690190881249911852582400, 550923875790150163780873329493220621458883503713639780465715200
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The sequence is bounded above by (n^2)!, the number of games of n X n tic-tac-toe that do not stop when a player wins.
|
|
LINKS
|
J. Ferry, n X n tic-tac-toe (Mathematica programs followed by results)
Index entries for sequences related to tic-tac-toe
|
|
CROSSREFS
|
Cf. A008907, A048245, A048246, A061527, A061528, A061529, A061530.
Sequence in context: A058550 A145200 A007240 this_sequence A159422 A028371 A013774
Adjacent sequences: A061523 A061524 A061525 this_sequence A061527 A061528 A061529
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jim Ferry (jferry(AT)alum.mit.edu), May 04 2001
|
|
|
Search completed in 0.002 seconds
|
