Triangle read by rows: T(n,k) is the number of nonempty labeled antichains of subsets of [n] such that the largest subset is of size k.
A379712
Triangle read by rows: T(n,k) is the number of nonempty labeled antichains of subsets of [n] such that the largest subset is of size k.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =3a(5) =1a(6) =1a(7) =7a(8) =10a(9) =1a(10) =1a(11) =15a(12) =97a(13) =53a(14) =1a(15) =1a(16) =31a(17) =1418a(18) =5443a(19) =686a(20) =1a(21) =1a(22) =63a(23) =40005a(24) =3701128a(25) =4043864a(26) =43291a(27) =1
External references
- oeis: A379712