Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007565 Number of Go games with n moves.
(Formerly M5447) 		3
1, 362, 130683, 47046243, 16889859363, 6046709375131 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
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
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,fini,nice,hard
AUTHOR
N. J. A. Sloane
EXTENSIONS
2 more terms from Arlin Anderson (starship1(AT)gmail.com)
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 27 18:17 EDT 2024. Contains 375471 sequences. (Running on oeis4.)