Triangle read by rows: T(n,k) = number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1.
A001100
Triangle read by rows: T(n,k) = number of permutations of length n with exactly k rising or falling successions, for n >= 1, 0 <= k <= n-1.
Terms
- a(0) =1a(1) =0a(2) =2a(3) =0a(4) =4a(5) =2a(6) =2a(7) =10a(8) =10a(9) =2a(10) =14a(11) =40a(12) =48a(13) =16a(14) =2a(15) =90a(16) =230a(17) =256a(18) =120a(19) =22a(20) =2a(21) =646a(22) =1580a(23) =1670a(24) =888a(25) =226a(26) =28a(27) =2a(28) =5242a(29) =12434
External references
- oeis: A001100