This site is supported by donations to The OEIS Foundation.



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007565 Number of Go games with n moves.
(Formerly M5447)

%I M5447

%S 1,362,130683,47046243,16889859363,6046709375131

%N Number of Go games with n moves.

%C 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 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 Cho Chikun, Go: a Complete Introduction to the Game, Kiseido Publishers, Tokyo, 1997.

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

%D H. Taylor, personal communication. [Scanned letter will be added. - _N. J. A. Sloane_, Nov 25 2016]

%H D. Forgues, <a href="http://oeis.org/wiki/Game_of_Go">Game of Go</a>, OEIS wiki, Feb. 2016.

%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/Go.html">Go</a>.

%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Go_%28game%29">Go</a>.

%F a(n) = a(n-1) + A048289(n) for n > 0. - _M. F. Hasler_, Nov 24 2016

%Y Cf. A048289.

%K nonn,fini,nice,hard

%O 0,2

%A _N. J. A. Sloane_

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

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 March 21 20:35 EDT 2019. Contains 321382 sequences. (Running on oeis4.)