This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A227763 #12 Feb 28 2020 22:52:56
%S A227763 1,4,5,6,7,8,9,10,13,14,15,16,17,18,19,20,21,22,23,24,25,26,28,29,30,
%T A227763 31,32,33,34,35,38,39,40,41,42,43,44,45,46,47,48,49,50,52,53,54,55,56,
%U A227763 58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75
%N A227763 Winning positions in the misere version of the Subtract-a-Prime game.
%C A227763 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 wins. This sequence is the set of winning positions in this game.
%t A227763 moves[n_]:= Table[n - Prime[i], {i, 1, PrimePi[n]}]; gana[n_]:= gana[n] = If[n < 2, True, !Select[moves[n], !gana[#]&]=={}]; Select[Range[155], gana[#] &]
%Y A227763 Cf. A227691, A025043, A227764.
%K A227763 nonn
%O A227763 1,2
%A A227763 _José María Grau Ribas_, Jul 29 2013