Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the maximal number of contiguous border edges starting from the root in both directions is equal to k.
A102595
Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the maximal number of contiguous border edges starting from the root in both directions is equal to k.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =0a(4) =0a(5) =3a(6) =1a(7) =4a(8) =3a(9) =4a(10) =7a(11) =20a(12) =15a(13) =8a(14) =5a(15) =42a(16) =102a(17) =72a(18) =36a(19) =15a(20) =6a(21) =245a(22) =540a(23) =366a(24) =176a(25) =70a(26) =24a(27) =7a(28) =1428a(29) =2950
External references
- oeis: A102595