Triangular array read by rows: T(n, k) = number of occurrences of 2k as a sum |1 - p(1)| + |2 - p(2)| + ... + |n - p(n)|, where (p(1), p(2), ..., p(n)) ranges through the permutations of (1,2,...,n), for n >= 1, 0 <= k <= n-1.
A357329
Triangular array read by rows: T(n, k) = number of occurrences of 2k as a sum |1 - p(1)| + |2 - p(2)| + ... + |n - p(n)|, where (p(1), p(2), ..., p(n)) ranges through the permutations of (1,2,...,n), for n >= 1, 0 <= k <= n-1.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =3a(6) =1a(7) =3a(8) =7a(9) =9a(10) =1a(11) =4a(12) =12a(13) =24a(14) =35a(15) =1a(16) =5a(17) =18a(18) =46a(19) =93a(20) =137a(21) =1a(22) =6a(23) =25a(24) =76a(25) =187a(26) =366a(27) =591a(28) =1a(29) =7
External references
- oeis: A357329