Number T(n,k) of permutations of [n] with k ordered cycles such that equal-sized cycles are ordered with increasing least elements; triangle T(n,k), n>=0, 0<=k<=n, read by rows.
A285849
Number T(n,k) of permutations of [n] with k ordered cycles such that equal-sized cycles are ordered with increasing least elements; 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) =1a(6) =0a(7) =2a(8) =6a(9) =1a(10) =0a(11) =6a(12) =19a(13) =18a(14) =1a(15) =0a(16) =24a(17) =100a(18) =105a(19) =40a(20) =1a(21) =0a(22) =120a(23) =508a(24) =1005a(25) =430a(26) =75a(27) =1a(28) =0a(29) =720
External references
- oeis: A285849