This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A164950 1 if there is a winning strategy for misère Sprouts with n initial points, else 0. 1

%I

%S 1,0,0,0,1,1,0,0,0,1,1,1,0,0,0,1,1,1,0,0

%N 1 if there is a winning strategy for misère Sprouts with n initial points, else 0.

%C This comes from changing "W" to "1" and "L" to "0" in Figure 1, p. 2 of Lemoine & Viennot's paper.

%C Lemoine & Viennot conjecture that, for n > 4, a(n) = 1 if and only if n is 0, 4, or 5 mod 6. - _Charles R Greathouse IV_, Dec 13 2012

%D Elwyn Berkelamp, John Conway, and Richard Guy, Winning ways for your mathematical plays, A K Peters, 2001.

%D Martin Gardner, Mathematical games : of sprouts and brussels sprouts, games with a topological flavor, Scientific American 217 (July 1967), 112-115.

%H D. Applegate, G. Jacobson, and D. Sleator, <a href="https://www.cs.cmu.edu/~sleator/papers/Sprouts.htm">Computer Analysis of Sprouts</a>, Tech. Report CMU-CS-91-144, Carnegie Mellon University Computer Science Technical Report, 1991.

%H Julien Lemoine, Simon Viennot, <a href="http://arxiv.org/abs/0908.4407">Analysis of misère Sprouts game with reduced canonical trees</a>, arXiv:0908.4407 [math.CO], 2009.

%H Julien Lemoine, Simon Viennot, <a href="http://sprouts.tuxfamily.org/wiki/doku.php?id=records#misere_sprouts">Records / Misère Sprouts</a>, SproutsWiki

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Sprouts_(game)">Sprouts</a>

%Y Cf. A164951.

%K nonn,hard,more

%O 1,1

%A _Jonathan Vos Post_, Sep 01 2009

%E a(18)-a(20) from _Andrey Zabolotskiy_, Feb 19 2018 from SproutsWiki

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.

Last modified October 17 18:51 EDT 2019. Contains 328127 sequences. (Running on oeis4.)