This site is supported by donations to The OEIS Foundation.



Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A269417 Number of Go games on n X n board with no repeating position and suicide allowed. 1
1, 1, 386356909593 (list; graph; refs; listen; history; text; internal format)



I only chose starting offset 0 because the number of 3 X 3 games is unknown (and over a thousand digits).

a(n) is also the number of simple paths in the Go game graph starting at the empty position.

a(n) is upper bounded by n^{2*3^{n^2}}, as shown in Theorem 7 from the linked paper.


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

J. Tromp and G. Farneb├Ąck, Combinatorics of Go, Lecture Notes in Computer Science, 4630, 84-99, 2007.


a(1) = 1 since the only legal Go game on a 1 X 1 board is Black pass, White pass.


Cf. A094777.

Sequence in context: A172714 A080132 A080122 * A281963 A082411 A113952

Adjacent sequences:  A269414 A269415 A269416 * A269418 A269419 A269420




John Tromp, Feb 25 2016



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 December 10 04:15 EST 2019. Contains 329885 sequences. (Running on oeis4.)