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 #7 Mar 30 2012 16:48:45
%S 1,2,4,8,16,31,32,64,103,128,171,213,256,301,342,439,475,494,512,558,
%T 595,911,1024,1075,1114,1189,1287,1606,1727,1996,2048,2102,2140,2225,
%U 2339,2667,2691,3240,3733,4096,4153,4171,4371,4745,4912,5237,5601,5746
%N a(n) = smallest nonnegative integer not the Nim sum of at most 4 earlier terms.
%C Grundy function for turn-at-most-5-coins game.
%D E. R. Berlekamp, J. H. Conway and R. K. Guy, Winning Ways, Academic Press, NY, 2 vols., 1982, see Table 3, Chapter 14, p. 433.
%H A. S. Fraenkel, <a href="http://www.wisdom.weizmann.ac.il/~fraenkel/Papers/wolf4.ps">Mathematical Chats Between Two Physicists</a>, in Puzzlers' Tribute: A Feast for the Mind, honoring Martin Gardner (D. Wolfe and T. Rodgers, eds.), A. K. Peters, 2002, pp. 315-325.
%H <a href="/index/Ni#Nimsums">Index entries for sequences related to Nim-sums</a>
%Y Cf. A000069, A033623, A054043, etc.
%K nonn,nice
%O 1,2
%A _N. J. A. Sloane_, Apr 29 2000
%E More terms from Larry Reeves (larryr(AT)acm.org), Oct 31 2000