The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.



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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066225 Covering numbers C(n,n-4,n-5). 3
3, 7, 14, 30, 50, 84, 126, 185, 259, 357, 476 (list; graph; refs; listen; history; text; internal format)



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 Jeffrey H. Dinitz and D. R. Stinson, editors, Contemporary Design Theory, Wiley, 1992.

A. Sidorenko, On Turan numbers of the complete 4-graphs, Discr. Math., 344 (2021), #112544.


Table of n, a(n) for n=6..16.

D. Applegate, E. M. Rains and N. J. A. Sloane, On asymmetric coverings and covering numbers, J. Comb. Des. 11 (2003), 218-228.

D. Gordon, La Jolla Repository of Coverings

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.

Index entries for covering numbers


A column of A066010. A036830 is a lower bound.

Sequence in context: A267210 A074988 A265381 * A305777 A139817 A173010

Adjacent sequences:  A066222 A066223 A066224 * A066226 A066227 A066228




N. J. A. Sloane


More terms from Sidorenko (2021) added by N. J. A. Sloane, Oct 31 2021



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 8 08:06 EST 2021. Contains 349594 sequences. (Running on oeis4.)