Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the leftmost child of the root has degree k.
A101401
Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the leftmost child of the root has degree k.
Terms
- a(0) =1a(1) =1a(2) =2a(3) =3a(4) =6a(5) =3a(6) =12a(7) =24a(8) =15a(9) =4a(10) =55a(11) =110a(12) =75a(13) =28a(14) =5a(15) =273a(16) =546a(17) =390a(18) =168a(19) =45a(20) =6a(21) =1428a(22) =2856a(23) =2100a(24) =980a(25) =315a(26) =66a(27) =7a(28) =7752a(29) =15504
External references
- oeis: A101401