Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that the set {|p(i)-i|, i=1,2,...,n} has exactly k elements (1<=k<=n).

A125183

Triangle read by rows: T(n,k) is the number of permutations p of {1,2,...,n} such that the set {|p(i)-i|, i=1,2,...,n} has exactly k elements (1<=k<=n).

Terms

    a(0) =1a(1) =2a(2) =0a(3) =1a(4) =5a(5) =0a(6) =3a(7) =11a(8) =6a(9) =4a(10) =1a(11) =28a(12) =55a(13) =32a(14) =4a(15) =3a(16) =69a(17) =210a(18) =330a(19) =108a(20) =0a(21) =1a(22) =102a(23) =846a(24) =2177a(25) =1590a(26) =324a(27) =0a(28) =4a(29) =279

External references