INRIA Algorithms Project, <a href="http://algoecs.inria.fr/ecsservices/ecsstructure?searchType=1&service=Search&searchTermsnbr=95">Encyclopedia of Combinatorial Structures 95</a>
INRIA Algorithms Project, <a href="http://algoecs.inria.fr/ecsservices/ecsstructure?searchType=1&service=Search&searchTermsnbr=95">Encyclopedia of Combinatorial Structures 95</a>
editing
approved
a(n) ~ c * d^n / n^(3/2), where d = 2.2318799173898687960533559522113115638..., c = 0.3390616344584879699709248904124... . - Vaclav Kotesovec, May 04 2015
Vaclav Kotesovec, <a href="/A052525/b052525.txt">Table of n, a(n) for n = 0..1000</a>
approved
editing
editing
approved
More terms from _Paul. Zimmermann(AT)loria.fr, _, Oct 31 2002
approved
editing
Old name was "Non-planar unlabeled trees with neither unary nor binary nodes". I am leaving this alternative name here because it may help clarify the definitions of related sequences. - _N. J. A. Sloane (njas(AT)research.att.com)_.
INRIA Algorithms Project, <a href="http://algo.inria.fr/binecs/encyclopediaecs?searchType=1&=ECSnb&argsearchsearchTerms=95">Encyclopedia of Combinatorial Structures 95</a>
INRIA Algorithms Project, <a href="http://algo.inria.fr/bin/encyclopedia?Search=ECSnb&argsearch=95">Encyclopedia of Combinatorial Structures 95</a>
easy,nonn,new
Old name was "Non-planar unlabeled trees with neither unary nor binary nodes". I am leaving this alternative name here because it may help clarify the definitions of related sequences. - N. J. A. Sloane (njas(AT)research.att.com).
easy,nonn,new