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 A000509 #22 Jan 09 2017 04:40:02 %S A000509 6,6,8,10,12,13,14,14,17,21,22,24 %N A000509 Size of second largest n-arc in PG(2,q), where q runs through the primes and prime powers >= 7. %C A000509 The Davydov et al. reference arXiv:10004.2817 has data sufficient for a b-file. - _Jonathan Vos Post_, Apr 18 2010 %C A000509 The terms run through indices q=A000961(i), i>=6. - _R. J. Mathar_, Jan 09 2017 %H A000509 Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco, <a href="http://arxiv.org/abs/1004.2817">New sizes of complete arcs in PG(2,q)</a>, arXiv:1004.2817 [math.CO], April 16, 2010. %H A000509 Alexander A. Davydov, Giorgio Faina, Stefano Marcugini, Fernanda Pambianco, <a href="http://dx.doi.org/10.1007/s00022-009-0009-3">On sizes of complete caps in projective spaced PG(n,q) and arcs in planes PG(2,q)</a>, J. Geom. 94 (1) (2009) 31-58. %H A000509 J. W. P. Hirschfeld, <a href="http://dx.doi.org/10.1016/S0012-365X(96)00330-5">Complete arcs</a>, Discr. Math., 174 (1997), 177-184. %H A000509 J. W. P. Hirschfeld and L. Storme, <a href="https://cage.ugent.be/~ls/max2000finalprocfilejames.pdf">The packing problem in statistics, coding theory and finite projective spaces</a>, J. Statist. Plann. Inference 72 (1998), no. 1-2, 355-380. %H A000509 G. Keri, <a href="http://dx.doi.org/10.1002/jcd.20091">Types of superregular matrices and the number of n-arcs and complete n-arcs in PG(r,q)</a>, Journal of Combinatorial Designs, Vol. 14 (2006), pp. 363-390. %e A000509 m'(31)=22 because there are no complete n-arcs in PG(2,31) for 23<=n<=31. %Y A000509 Cf. A000510. %Y A000509 Cf. A000961. %K A000509 nonn,hard,more,nice %O A000509 1,1 %A A000509 J. W. P. Hirschfeld [ jwph(AT)sussex.ac.uk ] %E A000509 Definition clarified by G. Keri (keri(AT)sztaki.hu), Jan 03 2008