Triangle T(n,k) (0 <= k <= n) giving number of chains of length k in partially ordered set formed from subsets of n-set by inclusion.

A038719

Triangle T(n,k) (0 <= k <= n) giving number of chains of length k in partially ordered set formed from subsets of n-set by inclusion.

Terms

    a(0) =1a(1) =2a(2) =1a(3) =4a(4) =5a(5) =2a(6) =8a(7) =19a(8) =18a(9) =6a(10) =16a(11) =65a(12) =110a(13) =84a(14) =24a(15) =32a(16) =211a(17) =570a(18) =750a(19) =480a(20) =120a(21) =64a(22) =665a(23) =2702a(24) =5460a(25) =5880a(26) =3240a(27) =720a(28) =128a(29) =2059

External references