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 A066225 #25 May 18 2025 07:57:26 %S A066225 3,7,14,30,50,84,126,185,259,357,476 %N A066225 Covering numbers C(n,n-4,n-5). %C A066225 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 A066225 CRC Handbook of Combinatorial Designs, 1996, p. 263. %D A066225 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 A066225 D. Applegate, E. M. Rains and N. J. A. Sloane, <a href="https://arxiv.org/abs/math/0205303">On asymmetric coverings and covering numbers</a>, arXiv:math/0205303 [math.CO], 2002; J. Comb. Des. 11 (2003), 218-228. %H A066225 D. Gordon, <a href="http://www.dmgordon.org/cover">La Jolla Repository of Coverings</a> %H A066225 K. Markström, <a href="http://abel.math.umu.se/~klasm/Data/hypergraphs/coveringdesign.html">Covering designs</a>. %H A066225 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 A066225 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 A066225 A. Sidorenko, <a href="https://doi.org/10.1016/j.disc.2021.112544">On Turan numbers of the complete 4-graphs</a>, Discr. Math., 344 (2021), #112544. %H A066225 <a href="/index/Cor#covnum">Index entries for covering numbers</a> %Y A066225 A column of A066010. %Y A066225 A036830 is a lower bound. %K A066225 nonn,hard,more %O A066225 6,1 %A A066225 _N. J. A. Sloane_ %E A066225 More terms from Sidorenko (2021) added by _N. J. A. Sloane_, Oct 31 2021