Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the maximum number of contiguous border edges starting from the root in counterclockwise direction is equal to k.
A102593
Triangle read by rows: T(n,k) is the number of noncrossing trees with n edges in which the maximum number of contiguous border edges starting from the root in counterclockwise direction is equal to k.
Terms
- a(0) =1a(1) =0a(2) =1a(3) =1a(4) =1a(5) =1a(6) =5a(7) =4a(8) =2a(9) =1a(10) =25a(11) =18a(12) =8a(13) =3a(14) =1a(15) =130a(16) =88a(17) =37a(18) =13a(19) =4a(20) =1a(21) =700a(22) =455a(23) =185a(24) =63a(25) =19a(26) =5a(27) =1a(28) =3876a(29) =2448
External references
- oeis: A102593