Number of binary labeled trees with two-colored vertices that have n leaves and avoid the easiest to avoid 6-pattern set.
A227250
Number of binary labeled trees with two-colored vertices that have n leaves and avoid the easiest to avoid 6-pattern set.
Terms
- a(0) =1a(1) =2a(2) =6a(3) =42a(4) =390a(5) =4698a(6) =69174
External references
- oeis: A227250