Triangle read by rows: T(n,k) is the number of Dyck n-paths with k large components, 0 <= k <= n/2.

Terms

a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =4a(6) =1a(7) =12a(8) =1a(9) =1a(10) =34a(11) =7a(12) =1a(13) =98a(14) =32a(15) =1a(16) =1a(17) =294a(18) =124a(19) =10a(20) =1a(21) =919a(22) =448a(23) =61a(24) =1a(25) =1a(26) =2974a(27) =1576a(28) =298a(29) =13