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

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A143674 Number of maximal antichains in the poset of Dyck paths ordered by inclusion. 2
 1, 1, 2, 4, 17, 379, 526913 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Maximal antichains are those which cannot be extended without violating the antichain condition. This is the breakdown by size of (or number of elements in) the antichains beginning with antichains of size 0 and increasing: n=0: 0, 1; n=1: 0, 1; n=2: 0, 2; n=3: 0, 3,  1; n=4: 0, 3,  8,   6; n=5: 0, 3, 14,  62, 132,  124,    42,     2; n=6: 0, 3, 21, 157, 983, 4438, 15454, 41827, 79454, 112344, 117259, 88915, 47295, 14909, 3498, 334, 21, 1 REFERENCES R. P. Stanley, Enumerative Combinatorics 1, Cambridge University Press, New York, 1997. LINKS EXAMPLE For n = 3 there are 4 maximal antichains. Assume that the five elements in the D_3 poset are depicted using a Hasse diagram and labeled A through E from bottom to top. Then the 4 maximal antichains are {A}, {B,C}, {D}, {E}. CROSSREFS Cf. A143672. Total number of antichains A143673. Sequence in context: A048872 A063800 A207137 * A136147 A275837 A119510 Adjacent sequences:  A143671 A143672 A143673 * A143675 A143676 A143677 KEYWORD nonn,more AUTHOR Jennifer Woodcock (jennifer.woodcock(AT)ugdsb.on.ca), Aug 28 2008 EXTENSIONS a(6) from Alois P. Heinz, Jul 31 2011 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.

Last modified January 21 05:23 EST 2020. Contains 331104 sequences. (Running on oeis4.)