Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges and k leaves.

Terms

a(0) =1a(1) =2a(2) =1a(3) =4a(4) =7a(5) =1a(6) =8a(7) =30a(8) =16a(9) =1a(10) =16a(11) =104a(12) =122a(13) =30a(14) =1a(15) =32a(16) =320a(17) =660a(18) =365a(19) =50a(20) =1a(21) =64a(22) =912a(23) =2920a(24) =2875a(25) =903a(26) =77a(27) =1a(28) =128a(29) =2464