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 A007565 M5447 #28 Feb 16 2025 08:32:31 %S A007565 1,362,130683,47046243,16889859363,6046709375131 %N A007565 Number of Go games with n moves. %C A007565 No value up to a(5) in this sequence is prime. The semiprimes in the sequence begin: 362 = 2 * 181, 6046709375131 = 19 * 318247861849. - _Jonathan Vos Post_, Apr 02 2011 %C A007565 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 %D A007565 Cho Chikun, Go: a Complete Introduction to the Game, Kiseido Publishers, Tokyo, 1997. %D A007565 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A007565 H. Taylor, personal communication. [Scanned letter will be added. - _N. J. A. Sloane_, Nov 25 2016] %H A007565 D. Forgues, <a href="http://oeis.org/wiki/Game_of_Go">Game of Go</a>, OEIS wiki, Feb. 2016. %H A007565 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/Go.html">Go</a>. %H A007565 Wikipedia, <a href="http://en.wikipedia.org/wiki/Go_%28game%29">Go</a>. %F A007565 a(n) = a(n-1) + A048289(n) for n > 0. - _M. F. Hasler_, Nov 24 2016 %Y A007565 Cf. A048289. %K A007565 nonn,fini,nice,hard %O A007565 0,2 %A A007565 _N. J. A. Sloane_ %E A007565 2 more terms from Arlin Anderson (starship1(AT)gmail.com)