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

Terms

a(0) =1a(1) =2a(2) =1a(3) =4a(4) =4a(5) =4a(6) =8a(7) =12a(8) =24a(9) =11a(10) =16a(11) =32a(12) =96a(13) =88a(14) =41a(15) =32a(16) =80a(17) =320a(18) =440a(19) =410a(20) =146a(21) =64a(22) =192a(23) =960a(24) =1760a(25) =2460a(26) =1752a(27) =564a(28) =128a(29) =448