login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A213685 Arises in enumerating maximal antichains of minimum size. 0

%I #11 Jun 21 2012 11:00:28

%S 1,3,6,9,12,17,22,28,33,41,48,57,64

%N Arises in enumerating maximal antichains of minimum size.

%C Rightmost column of Table 1: Computational results for small values of n, of Kalinowski.

%H Thomas Kalinowski, Uwe Leck, Ian T. Roberts, <a href="http://arxiv.org/abs/1206.3007">Maximal antichains of minimum size</a>, arXiv:1206.3007v1 [math.CO], Jun 14 2012.

%K hard,nonn,more

%O 4,2

%A _Jonathan Vos Post_, Jun 17 2012

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 13:12 EDT 2024. Contains 371969 sequences. (Running on oeis4.)