Triangle T(n,k) is the number of permutations on n elements with at least one k-cycle for 1 <= k <= n.
A293211
Triangle T(n,k) is the number of permutations on n elements with at least one k-cycle for 1 <= k <= n.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =4a(4) =3a(5) =2a(6) =15a(7) =9a(8) =8a(9) =6a(10) =76a(11) =45a(12) =40a(13) =30a(14) =24a(15) =455a(16) =285a(17) =200a(18) =180a(19) =144a(20) =120a(21) =3186a(22) =1995a(23) =1400a(24) =1260a(25) =1008a(26) =840a(27) =720a(28) =25487a(29) =15855
External references
- oeis: A293211