%I
%S 0,1,0,1,2,0,1,0,1,2,0,1,2,0,1,0,1,2,0,1,0,1,2,0,1,2,0,1,2,0,1,0,1,2,
%T 0,1,0,1,2,0,1,2,0,1,0,1,2,0,1,0,1,2,0,1,2,0,1,2,0,1,0,1,2,0,1,0,1,2,
%U 0,1,2,0,1,2,0,1,0,1,2,0,1,0,1,2,0,1,2,0,1,0,1,2,0,1,0,1,2,0,1,2
%N Nim sequence of game on n counters whose legal moves are removing some number of counters in A242079.
%C For all n, a(n)=0, a(n)=1, or a(n)=2.
%C For all n, a(n)=0 if and only if a(n+1)=1.
%C This sequence is aperiodic if and only if A242079 is infinite.
%D E. R. Berlekamp, J. H. Conway and R. K. Guy, "Winning Ways", pp. 8386
%H N. Fox, <a href="http://vimeo.com/93540244">Aperiodic Subtraction Games</a>, Talk given at the Rutgers Experimental Mathematics Seminar, May 01 2014.
%Y Cf. A242079.
%K nonn
%O 0,5
%A _Nathan Fox_, May 03 2014
