Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the leftmost leaf is at level k.

A101409

Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the leftmost leaf is at level k.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =3a(4) =5a(5) =4a(6) =12a(7) =19a(8) =16a(9) =8a(10) =55a(11) =85a(12) =73a(13) =44a(14) =16a(15) =273a(16) =416a(17) =361a(18) =234a(19) =112a(20) =32a(21) =1428a(22) =2156a(23) =1883a(24) =1269a(25) =680a(26) =272a(27) =64a(28) =7752a(29) =11628

External references