Triangle read by rows: T(n,k) = number of Schroeder paths of length 2n and having k ascents.

Terms

a(0) =1a(1) =1a(2) =1a(3) =1a(4) =4a(5) =1a(6) =1a(7) =11a(8) =9a(9) =1a(10) =1a(11) =26a(12) =46a(13) =16a(14) =1a(15) =1a(16) =57a(17) =180a(18) =130a(19) =25a(20) =1a(21) =1a(22) =120a(23) =603a(24) =750a(25) =295a(26) =36a(27) =1a(28) =1a(29) =247