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

 

Logo

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”).

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A300099 The number of maximal left-compressed intersecting families of sets of size n from [m] when m >= 2n. 0
1, 2, 6, 72, 37145, 1081162102034 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

B. Barber, Maximum hitting for n sufficiently large, Graphs and Combinatorics, 30 (2014), no. 2, 267-274.

LINKS

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

B. Barber, Maximum hitting for n sufficiently large, arXiv:1203.4188 [math.CO], 2012.

B. Barber, Partition regularity and other combinatorial problems, PhD thesis, University of Cambridge, 2014.

B. Barber, The number of maximal left-compressed intersecting families

EXAMPLE

For n=2 the a(2)=2 maximal left-compressed intersecting families of 2-sets are the star of all sets containing 1, and the set of all 2-sets from {1,2,3}.

CROSSREFS

Sequence in context: A117515 A265936 A085865 * A061296 A019993 A218058

Adjacent sequences:  A300096 A300097 A300098 * A300100 A300101 A300102

KEYWORD

hard,more,nonn

AUTHOR

Ben Barber, Feb 24 2018

STATUS

approved

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 5 12:24 EST 2021. Contains 349557 sequences. (Running on oeis4.)