Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} in which the last entry of the first increasing run is equal to k (1 <= k <= n).
A134433
Triangle read by rows: T(n,k) is the number of permutations of {1,2,...,n} in which the last entry of the first increasing run is equal to k (1 <= k <= n).
Terms
- a(0) =1a(1) =0a(2) =2a(3) =0a(4) =1a(5) =5a(6) =0a(7) =2a(8) =6a(9) =16a(10) =0a(11) =6a(12) =16a(13) =33a(14) =65a(15) =0a(16) =24a(17) =60a(18) =114a(19) =196a(20) =326a(21) =0a(22) =120a(23) =288a(24) =522a(25) =848a(26) =1305a(27) =1957a(28) =0a(29) =720
External references
- oeis: A134433