This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A048289 #25 Feb 03 2025 22:53:49 %S A048289 1,361,129960 %N A048289 Number of Go games with exactly n moves. %C A048289 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^2-1 choices for placing his stone, so the value a(2) = 361^2 = 361*(361-1 + 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 %C A048289 This sequence counts distinct Go board positions after n moves, excluding terminated games. Positions are considered identical if stones and turn-to-play match, regardless of move history. (To be discussed!) Passing moves are omitted from non-terminal states, as early passes are exceptionally rare in practical play. %H A048289 Daniel Forgues, <a href="http://oeis.org/wiki/Game_of_Go">Game of Go</a>, OEIS wiki, Feb. 2016. %Y A048289 Cf. A007565. %K A048289 nonn,nice,hard,more,fini %O A048289 0,2 %A A048289 _N. J. A. Sloane_