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 A066011 #13 Feb 02 2020 20:51:03 %S A066011 1,8,20,63,126 %N A066011 Covering numbers C(n,8,7). %C A066011 C(v,k,t) is the smallest number of k-subsets of an n-set such that every t-subset is contained in at least one of the k-subsets. %D A066011 CRC Handbook of Combinatorial Designs, 1996, p. 263. %D A066011 W. H. Mills and R. C. Mullin, Coverings and packings, pp. 371-399 of Jeffrey H. Dinitz and D. R. Stinson, editors, Contemporary Design Theory, Wiley, 1992. %H A066011 D. Applegate, E. M. Rains and N. J. A. Sloane, <a href="http://arXiv.org/abs/math.CO/0205303">On asymmetric coverings and covering numbers</a>, J. Comb. Des. 11 (2003), 218-228. %H A066011 D. Gordon, <a href="http://www.dmgordon.org/cover">La Jolla Repository of Coverings</a> %H A066011 K. J. Nurmela and Patric R. J. Östergård, <a href="http://www.tcs.hut.fi/old/papers/tp1.ps.Z">New coverings of t-sets with (t+1)-sets</a>, J. Combinat. Designs, 7 (1999), 217-226. %H A066011 K. J. Nurmela and Patric R. J. Östergård, <a href="http://www.tcs.hut.fi/old/papers/table3.html">New coverings of t-sets with (t+1)-sets (appendix)</a>, J. Combinat. Designs, 7 (1999), 217-226. %H A066011 <a href="/index/Cor#covnum">Index entries for covering numbers</a> %Y A066011 A column of A066010. %K A066011 nonn,hard %O A066011 8,2 %A A066011 _N. J. A. Sloane_