login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061526 Number of complete games of n X n tic-tac-toe. 5
1, 24, 255168, 15038733958272, 12123953291699459229254400, 317158792989363996690190881249911852582400, 550923875790150163780873329493220621458883503713639780465715200 (list; graph; refs; listen; history; text; internal format)
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)
CROSSREFS
Sequence in context: A289029 A287964 A173172 * A159422 A028371 A013774
KEYWORD
nonn
AUTHOR
Jim Ferry (jferry(AT)alum.mit.edu), May 04 2001
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)