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 #13 Nov 13 2013 12:44:40
%S 2,3,4,5,6,7,8,11,12,13,14,15,16,17,18,19,20,21,22,23,24,26,27,28,29,
%T 30,31,32,33,36,37,38,39,40,41,42,43,44,45,46,47,48,50,51,52,53,54,56,
%U 57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74
%N Winning positions in the Subtract-a-Prime game.
%C Consider the following game: two players make moves in turn, initially the number on the board is n. Each move consists of subtracting a prime number that is at most the number on the board. The player who cannot play loses. This sequence is the set of winner positions in this game.
%C Complement of A025043.
%t moves[n_] := Table[n - Prime[i], {i, 1, PrimePi[n]}]
%t gana[n_] := gana[n] = If[n < 2, False,! Select[moves[n],!gana[#] &] == {}];
%t Select[Range[155], gana[#] &]
%o (PARI) is(n)=if(isprime(n) || isprime(n-1), return(1)); if(n<15,return(0)); for(k=9,n-1,if(isprime(n-k) && !is(k), return(1))); 0 \\ _Charles R Greathouse IV_, Nov 13 2013
%Y The Grundy numbers of this game are in A014589.
%K nonn
%O 1,1
%A _José María Grau Ribas_, Jul 19 2013