Square array read by antidiagonals downwards: for n >= 2, T(k,n) is the number of permutations of [k+n] that differ in every position from both the identity permutation and a permutation consisting of k 1-cycles and one n-cycle.

A335391

Square array read by antidiagonals downwards: for n >= 2, T(k,n) is the number of permutations of [k+n] that differ in every position from both the identity permutation and a permutation consisting of k 1-cycles and one n-cycle.

Terms

    a(0) =2a(1) =-1a(2) =0a(3) =0a(4) =1a(5) =2a(6) =1a(7) =0a(8) =1a(9) =4a(10) =2a(11) =3a(12) =4a(13) =7a(14) =18a(15) =13a(16) =16a(17) =19a(18) =24a(19) =35a(20) =88a(21) =80a(22) =95a(23) =114a(24) =137a(25) =168a(26) =221a(27) =530a(28) =579a(29) =672

External references