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 A227764 #9 May 18 2019 16:58:15
%S A227764 2,3,11,12,27,36,37,51,57,87,93,102,117,123,127,135,147,157,171,177,
%T A227764 189,197,207,219,237,249,255,261,267,291,297,303,311,312,321,327,337,
%U A227764 345,357,363,377,387,393,397,405,417,427,447,453,471,477,483,487,495
%N A227764 Losing positions in the misere version of the Subtract-a-Prime game.
%C A227764 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 lost positions in this game.
%t A227764 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 A227764 Cf. A227691, A025043, A227763.
%K A227764 nonn
%O A227764 1,1
%A A227764 _José María Grau Ribas_, Jul 29 2013