T(n,k) = number of arrays of length n that are sums of k consecutive elements of length n+k-1 permutations of 0..n+k-2.
A229565
T(n,k) = number of arrays of length n that are sums of k consecutive elements of length n+k-1 permutations of 0..n+k-2.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =6a(5) =6a(6) =1a(7) =12a(8) =16a(9) =24a(10) =1a(11) =20a(12) =96a(13) =120a(14) =120a(15) =1a(16) =30a(17) =264a(18) =304a(19) =648a(20) =720a(21) =1a(22) =42a(23) =524a(24) =2904a(25) =4416a(26) =5040a(27) =5040a(28) =1a(29) =56
External references
- oeis: A229565