

A048289


Number of Go games with exactly n moves.


3




OFFSET

0,2


COMMENTS

The sequence seems based on the assumption that the game starts with an empty 19 X 19 board, which is not necessarily the case in an official Go tournament. After any of the 361 = 19^2 choices for the first move, the opponent has 19^21 choices for placing his stone, so the value a(2) = 361^2 = 361*(3611 + 1) takes into account the possibility of not placing a stone. A detailed account of the precise rules used here would be useful to make the definition of this sequence complete.  M. F. Hasler, Nov 22 2016


LINKS

Table of n, a(n) for n=0..5.
D. Forgues, Game of Go, OEIS wiki, Feb. 2016.


FORMULA

a(n) = A007565(n)  A007565(n1), for n > 1.  M. F. Hasler, Nov 24 2016


CROSSREFS

Cf. A007565.
Sequence in context: A231770 A145121 A062788 * A191216 A013765 A013891
Adjacent sequences: A048286 A048287 A048288 * A048290 A048291 A048292


KEYWORD

nonn,nice,hard


AUTHOR

N. J. A. Sloane


EXTENSIONS

Arlin Anderson (starship1(AT)gmail.com)


STATUS

approved



