Number T(n,k) of colored set partitions of [n] where colors of the elements of subsets are distinct and in increasing order and exactly k colors are used; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

A322670

Number T(n,k) of colored set partitions of [n] where colors of the elements of subsets are distinct and in increasing order and exactly k colors are used; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =1a(5) =3a(6) =0a(7) =1a(8) =12a(9) =16a(10) =0a(11) =1a(12) =41a(13) =156a(14) =131a(15) =0a(16) =1a(17) =140a(18) =1155a(19) =2460a(20) =1496a(21) =0a(22) =1a(23) =497a(24) =8020a(25) =32600a(26) =47355a(27) =22482a(28) =0a(29) =1

External references