login

Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.

A066140
Covering numbers C(n,n-3,n-4).
1
3, 6, 12, 20, 30, 45, 63, 84
OFFSET
5,1
COMMENTS
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.
REFERENCES
CRC Handbook of Combinatorial Designs, 1996, p. 263.
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.
LINKS
K. J. Nurmela and Patric R. J. Östergård, New coverings of t-sets with (t+1)-sets, J. Combinat. Designs, 7 (1999), 217-226.
K. J. Nurmela and Patric R. J. Östergård, New coverings of t-sets with (t+1)-sets (appendix), J. Combinat. Designs, 7 (1999), 217-226.
CROSSREFS
A column of A066010.
Sequence in context: A160732 A320608 A246147 * A200067 A061061 A361272
KEYWORD
nonn
STATUS
approved