Triangle read by rows: T(n,k) is the number of partitions of a 3-colored set of n objects into at most k parts with 0 <= k <= n.

A382045

Triangle read by rows: T(n,k) is the number of partitions of a 3-colored set of n objects into at most k parts with 0 <= k <= n.

Terms

    a(0) =1a(1) =0a(2) =3a(3) =0a(4) =6a(5) =12a(6) =0a(7) =10a(8) =28a(9) =38a(10) =0a(11) =15a(12) =66a(13) =102a(14) =117a(15) =0a(16) =21a(17) =126a(18) =249a(19) =309a(20) =330a(21) =0a(22) =28a(23) =236a(24) =562a(25) =788a(26) =878a(27) =906a(28) =0a(29) =36

External references