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 A275432 #19 Nov 23 2016 11:18:15 %S A275432 0,3,10,13,44,47,102,105,146,149,232,235,636,639,814,817,950,953,1208, %T A275432 1211,2994,2997,4922,4925,4996,4999,6748,6751,8026,8029,8478,8481, %U A275432 12092,12095,14004,14007,31934,31937,35824,35827,41568,41571,46118,46121,60056,60059,62530,62533,106986,106989 %N A275432 P-positions for the subtraction game whose allowed moves are the practical numbers (A005153). %C A275432 According to a general theorem of Golomb (1966) on subtraction games, this sequence is infinite, and more strongly (because of known results on the density of A005153) the number of terms below any given n is at least logarithmic in n. %H A275432 S. W. Golomb, <a href="http://dx.doi.org/10.1016/S0021-9800(66)80016-9">A mathematical investigation of games of "take-away"</a>, J. Combinatorial Theory, 1 (1966), 443-458. %e A275432 For instance, 10 is a P-position because each of the available moves (subtracting 1, 2, 4, 6, or 8 to yield 9, 8, 6, 4, or 2) can be countered: from 8, 6, 4, or 2, it is possible to win by moving directly to 0 and from 9 it is possible to win by subtracting 6 and moving to the smaller P-position 3. %Y A275432 Cf. A030193. %K A275432 nonn %O A275432 0,2 %A A275432 _David Eppstein_, Nov 20 2016