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”).
%I #16 Mar 20 2018 15:24:47
%S 1,2,6,72,37145,1081162102034
%N The number of maximal left-compressed intersecting families of sets of size n from [m] when m >= 2n.
%D B. Barber, Maximum hitting for n sufficiently large, Graphs and Combinatorics, 30 (2014), no. 2, 267-274.
%H B. Barber, <a href="https://arxiv.org/abs/1203.4188">Maximum hitting for n sufficiently large</a>, arXiv:1203.4188 [math.CO], 2012.
%H B. Barber, <a href="http://babarber.uk/wp-content/uploads/2016/12/thesis-bab.pdf">Partition regularity and other combinatorial problems</a>, PhD thesis, University of Cambridge, 2014.
%H B. Barber, <a href="http://babarber.uk/374/maximal-left-compressed-intersecting-families/">The number of maximal left-compressed intersecting families</a>
%e 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}.
%K hard,more,nonn
%O 1,2
%A _Ben Barber_, Feb 24 2018