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!)
 A077765 Number of maximum-size antichains in partition lattice Par(n). 2
 1, 1, 2, 3, 5, 7, 2, 4, 15, 4, 2, 11, 18, 14, 53, 2, 54, 1606, 482, 104, 754, 536 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Par(n) is the set of partitions of n under 'dominance order': partition P is <= partition Q iff the sum of the largest k parts of P is <= the corresponding sum for Q for all k. LINKS EXAMPLE For n=10, the maximum size is A076269(10)=4. There are 2 maximum-size antichains: {5+1+1+1+1+1, 4+3+1+1+1, 4+2+2+2, 3+3+3+1} and {6+1+1+1+1, 5+2+2+1, 4+4+1+1, 4+3+3}. So a(10)=2. MATHEMATICA leq[p_, q_] := If[Length[p]

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 19 16:16 EST 2021. Contains 340270 sequences. (Running on oeis4.)