Triangular array read by rows: T(n,k) is the number of square n-permutations possessing exactly k cycles; n >= 0, 0 <= k <= n.

A349645

Triangular array read by rows: T(n,k) is the number of square n-permutations possessing exactly k cycles; n >= 0, 0 <= k <= n.

Terms

    a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =1a(6) =0a(7) =2a(8) =0a(9) =1a(10) =0a(11) =0a(12) =11a(13) =0a(14) =1a(15) =0a(16) =24a(17) =0a(18) =35a(19) =0a(20) =1a(21) =0a(22) =0a(23) =184a(24) =0a(25) =85a(26) =0a(27) =1a(28) =0a(29) =720

External references