login

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

A213685
Arises in enumerating maximal antichains of minimum size.
0
1, 3, 6, 9, 12, 17, 22, 28, 33, 41, 48, 57, 64
OFFSET
4,2
COMMENTS
Rightmost column of Table 1: Computational results for small values of n, of Kalinowski.
LINKS
Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Maximal antichains of minimum size, arXiv:1206.3007v1 [math.CO], Jun 14 2012.
CROSSREFS
Sequence in context: A127621 A049707 A378763 * A271449 A261956 A344683
KEYWORD
hard,nonn,more
AUTHOR
Jonathan Vos Post, Jun 17 2012
STATUS
approved