Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #6 Mar 07 2015 06:16:39
%S 0,3,11,19,29,45,71,97,123,149,175,313,407
%N P-positions in sparse Atomic Wari, octal game .37.
%C The sequence is only conjectured to be finite as of the publication in 1996, but there are definitely no more terms under 200000, so the conjecture seems extremely likely to be true.
%D J. Erickson, "Sowing Games", in Nowakowski (ed), Games of No Chance, 1996, p. 295.
%H J. Erickson, <a href="http://compgeom.cs.uiuc.edu/~jeffe/pubs/sowing.html">Sowing Games</a> article from <a href="http://tinyurl.com/2c3mv9">Games of No Chance</a>.
%e A player can remove one seed from any pile, or remove two seeds from any pile and optionally split the remainder into two piles.
%e A pile of 3 is a P-position because whether the player to move takes 1 or 2, the next player takes 2 or 1 and wins.
%K fini,nonn
%O 1,2
%A _Joshua Zucker_, Mar 15 2008