login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A061526
Number of complete games of n X n tic-tac-toe.
5
1, 24, 255168, 15038733958272, 12123953291699459229254400, 317158792989363996690190881249911852582400, 550923875790150163780873329493220621458883503713639780465715200
OFFSET
1,2
COMMENTS
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)
Sean A. Irvine, Java program (github)
KEYWORD
nonn
AUTHOR
Jim Ferry (jferry(AT)alum.mit.edu), May 04 2001
STATUS
approved