The number of forests of labeled rooted strictly binary trees (each vertex has exactly two children or none) on n nodes.
A200850
The number of forests of labeled rooted strictly binary trees (each vertex has exactly two children or none) on n nodes.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =4a(4) =13a(5) =91a(6) =511a(7) =5146a(8) =41329a(9) =544573a(10) =5704381a(11) =93001096a(12) =1203040741a(13) =23391560479a(14) =360416247283
External references
- oeis: A200850