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”).
%I #9 Feb 19 2023 17:12:10
%S 1,24,255168,15038733958272,12123953291699459229254400,
%T 317158792989363996690190881249911852582400,
%U 550923875790150163780873329493220621458883503713639780465715200
%N Number of complete games of n X n tic-tac-toe.
%C 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.
%H J. Ferry, <a href="http://ladybug.xs4all.nl/arlet/puzzles/solutions/contrib/tictactoe.html">n X n tic-tac-toe</a> (Mathematica programs followed by results)
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a061/A061526.java">Java program</a> (github)
%H <a href="/index/Th#TTT">Index entries for sequences related to tic-tac-toe</a>
%Y Cf. A008907, A048245, A048246, A061527, A061528, A061529, A061530.
%K nonn
%O 1,2
%A Jim Ferry (jferry(AT)alum.mit.edu), May 04 2001