A007565 Number of Go games with n moves. (Formerly M5447)

1, 362, 130683, 47046243, 16889859371, 6046709378019

Offset

0,2

Comments

The sequence is based on a 19 X 19 board which is empty in the initial state. The terms are the partial sums of A048289. - M. F. Hasler, Nov 24 2016

References

Cho Chikun, Go: a Complete Introduction to the Game, Kiseido Publishers, Tokyo, 1997.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

H. Taylor, personal communication. [Scanned letter will be added. - N. J. A. Sloane, Nov 25 2016]

Links

Table of n, a(n) for n=0..5.

D. Forgues, Game of Go, OEIS wiki, Feb. 2016.

Eric Weisstein's World of Mathematics, Go.

Wikipedia, Go.

Formula

a(n) = a(n-1) + A048289(n) for n > 0. - M. F. Hasler, Nov 24 2016

Crossrefs

Cf. A048289.

Sequence in context: A157442 A200558 A212324 * A098253 A031517 A192449

Adjacent sequences: A007562 A007563 A007564 * A007566 A007567 A007568

Keyword

nonn,nice,hard,more,fini

Author

N. J. A. Sloane

Extensions

2 more terms from Arlin Anderson (starship1(AT)gmail.com)

a(4) and a(5) corrected by Jinyuan Wang, May 02 2026

Status

approved