Triangle read by rows: T(n,k) = number of Dyck paths with n nodes and altitude k (1 <= k <= n).

Terms

a(0) =1a(1) =2a(2) =1a(3) =5a(4) =4a(5) =1a(6) =13a(7) =12a(8) =6a(9) =1a(10) =34a(11) =35a(12) =21a(13) =8a(14) =1a(15) =89a(16) =99a(17) =68a(18) =32a(19) =10a(20) =1a(21) =233a(22) =274a(23) =208a(24) =114a(25) =45a(26) =12a(27) =1a(28) =610a(29) =747