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 A263453 #17 Jan 12 2017 06:33:21 %S A263453 1,0,1,0,2,1,4,1,6,7,9,9,17,17,30,25,44,49,74,67,109,125,164,188,245, %T A263453 285,390,424,551,645,847,933,1199,1393,1747,2047,2463,2893,3622,4161, %U A263453 5016,5863,7203,8282,9973,11533,13927,16300,19095,22213,26645,30823,36166 %N A263453 Number of starting positions of Kayles with n pieces such that the 2nd player can win (P-positions). %C A263453 The partition p = (p_1,...,p_k) is counted if the Nimsum of the A002186(p_i) is 0. %H A263453 Eric M. Schmidt, <a href="/A263453/b263453.txt">Table of n, a(n) for n = 0..10000</a> %H A263453 Eric M. Schmidt, <a href="/A263453/a263453.cpp.txt">C++ code to compute this sequence</a> %H A263453 Wikipedia, <a href="https://en.wikipedia.org/wiki/Kayles">Kayles</a> %e A263453 For n = 6 the a(6) = 4 P-positions are (3,3), (3,2,1), (2,2,1,1), and (1,1,1,1,1,1). %Y A263453 Cf. A002186, A048833, A263454. %K A263453 nonn %O A263453 0,5 %A A263453 _Brian Hopkins_, Oct 18 2015 %E A263453 a(0) and more terms from _Eric M. Schmidt_, Jan 11 2017