Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
proposed
approved
editing
proposed
W. H. Mills and R. C. Mullin, Coverings and packings, pp. 371-399 of J. Jeffrey H. Dinitz and D. R. Stinson, editors,a Contemporary Design Theory, Wiley, 1992.
approved
editing
editing
approved
D. Gordon, <a href="http://www.ccrwestdmgordon.org/cover.html">La Jolla Repository of Coverings</a>
approved
editing
_N. J. A. Sloane (njas(AT)research.att.com), _, Dec 30 2001
<a href="/Sindx_index/Cor.html#covnum">Index entries for covering numbers</a>
<a href="/Sindx_Cor.html#covnum">Index entries for covering numbers</a>
nonn,tabl,more,new
<a href="http://www.research.att.com/~njas/sequences/Sindx_Cor.html#covnum">Index entries for covering numbers</a>
nonn,tabl,more,new
N. J. A. Sloane (njas, (AT)research.att.com), Dec 30 2001
Triangle of covering numbers T(n,k) = C(n,k,k-4), n >= 5, 5 <= k <= n.
1, 2, 1, 2, 3, 1, 2, 3, 4, 1, 2, 3, 4, 5, 1, 2, 4, 6, 5, 6, 1, 3, 6, 8, 9, 7, 7, 1, 3, 6, 11, 12, 12, 9, 8, 1
5,2
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.
CRC Handbook of Combinatorial Designs, 1996, p. 263.
W. H. Mills and R. C. Mullin, Coverings and packings, pp. 371-399 of J. H. Dinitz and D. R. Stinson, editors,a Contemporary Design Theory, Wiley, 1992.
D. Gordon, <a href="http://www.ccrwest.org/cover.html">La Jolla Repository of Coverings</a>
<a href="http://www.research.att.com/~njas/sequences/Sindx_Cor.html#covnum">Index entries for covering numbers</a>
1; 2 1; 2 3 1; 2 3 4 1; 2 3 4 5 1; ...
nonn,tabl,more
njas, Dec 30 2001
approved