login
This site is supported by donations to The OEIS Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061221 Number of tic-tac-toe games won after n plays. 0
0, 0, 0, 0, 1440, 5328, 47952, 72576, 81792 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

As in chess, a "play" is an action by a single player, a "move" is two contiguous plays (one by each opponent).

LINKS

Table of n, a(n) for n=1..9.

H. Bottomley, Details

Index entries for sequences related to tic-tac-toe

CROSSREFS

Sequence in context: A179691 A078095 A157508 * A238041 A187291 A187193

Adjacent sequences:  A061218 A061219 A061220 * A061222 A061223 A061224

KEYWORD

fini,full,nonn

AUTHOR

Henry Bottomley, May 31 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 14:13 EST 2019. Contains 319333 sequences. (Running on oeis4.)