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

Terms

a(0) =1a(1) =1a(2) =1a(3) =1a(4) =2a(5) =3a(6) =5a(7) =8a(8) =1a(9) =13a(10) =23a(11) =6a(12) =35a(13) =69a(14) =27a(15) =1a(16) =97a(17) =212a(18) =110a(19) =10a(20) =275a(21) =662a(22) =426a(23) =66a(24) =1a(25) =794a(26) =2091a(27) =1602a(28) =360a(29) =15