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, and no two consecutive rises or falls in the latter permutation.
A229717
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, and no two consecutive rises or falls in the latter permutation.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =1a(4) =4a(5) =4a(6) =1a(7) =8a(8) =6a(9) =10a(10) =1a(11) =18a(12) =28a(13) =32a(14) =32a(15) =1a(16) =26a(17) =76a(18) =82a(19) =86a(20) =122a(21) =1a(22) =40a(23) =256a(24) =436a(25) =500a(26) =544a(27) =544a(28) =1a(29) =52
External references
- oeis: A229717