Triangle T(n,k) is the number of partitions of an n-set into lists (cf. A000262) with k lists of size 1.

A114329

Triangle T(n,k) is the number of partitions of an n-set into lists (cf. A000262) with k lists of size 1.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =2a(4) =0a(5) =1a(6) =6a(7) =6a(8) =0a(9) =1a(10) =36a(11) =24a(12) =12a(13) =0a(14) =1a(15) =240a(16) =180a(17) =60a(18) =20a(19) =0a(20) =1a(21) =1920a(22) =1440a(23) =540a(24) =120a(25) =30a(26) =0a(27) =1a(28) =17640a(29) =13440

External references