login
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
OFFSET
1,2
REFERENCES
B. Barber, Maximum hitting for n sufficiently large, Graphs and Combinatorics, 30 (2014), no. 2, 267-274.
LINKS
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: A265936 A085865 A375846 * A061296 A019993 A357024
KEYWORD
hard,more,nonn
AUTHOR
Ben Barber, Feb 24 2018
STATUS
approved