Triangle T(n,k), the number of permutations on n elements that have no cycles of length k.

Terms

a(0) =0a(1) =1a(2) =1a(3) =2a(4) =3a(5) =4a(6) =9a(7) =15a(8) =16a(9) =18a(10) =44a(11) =75a(12) =80a(13) =90a(14) =96a(15) =265a(16) =435a(17) =520a(18) =540a(19) =576a(20) =600a(21) =1854a(22) =3045a(23) =3640a(24) =3780a(25) =4032a(26) =4200a(27) =4320a(28) =14833a(29) =24465