Triangle T(n,k) giving the number of permutations of 1..n with no adjacent elements within k in value, for n >= 2, 1 <= k <= floor(n/2).
A322255
Triangle T(n,k) giving the number of permutations of 1..n with no adjacent elements within k in value, for n >= 2, 1 <= k <= floor(n/2).
Terms
- a(0) =2a(1) =6a(2) =24a(3) =2a(4) =120a(5) =14a(6) =720a(7) =90a(8) =2a(9) =5040a(10) =646a(11) =32a(12) =40320a(13) =5242a(14) =368a(15) =2a(16) =362880a(17) =47622a(18) =3984a(19) =72a(20) =3628800a(21) =479306a(22) =44304a(23) =1496a(24) =2a(25) =39916800a(26) =5296790a(27) =521606a(28) =25384a(29) =160
External references
- oeis: A322255