T(n,k) = M(2n-1,n-1,k-1), 0 <= k <= n, n >= 0, where M(p,q,r) is the number of upright paths from (0,0) to (p,p-q) that meet the line y = x+r and do not rise above it.
A050144
T(n,k) = M(2n-1,n-1,k-1), 0 <= k <= n, n >= 0, where M(p,q,r) is the number of upright paths from (0,0) to (p,p-q) that meet the line y = x+r and do not rise above it.
Terms
- a(0) =0a(1) =1a(2) =0a(3) =1a(4) =1a(5) =1a(6) =2a(7) =3a(8) =4a(9) =1a(10) =5a(11) =9a(12) =14a(13) =6a(14) =1a(15) =14a(16) =28a(17) =48a(18) =27a(19) =8a(20) =1a(21) =42a(22) =90a(23) =165a(24) =110a(25) =44a(26) =10a(27) =1a(28) =132a(29) =297
External references
- oeis: A050144