Number T(n,k) of colored compositions of n using all colors of a k-set such that all parts have different color patterns and the patterns for parts i have i colors in (weakly) increasing order; triangle T(n,k), n>=0, 0<=k<=n, read by rows.

A327245

Number T(n,k) of colored compositions of n using all colors of a k-set such that all parts have different color patterns and the patterns for parts i have i colors in (weakly) increasing order; 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) =3a(8) =10a(9) =13a(10) =0a(11) =3a(12) =39a(13) =87a(14) =75a(15) =0a(16) =5a(17) =100a(18) =510a(19) =836a(20) =541a(21) =0a(22) =11a(23) =303a(24) =2272a(25) =7042a(26) =9025a(27) =4683a(28) =0a(29) =13

External references