The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A200793 The number of forests on n nodes of rooted labeled binary trees (each node has degree <=2). 0
 1, 1, 3, 16, 121, 1191, 14461, 209098, 3510921, 67175461, 1443249271, 34412298636, 901898694313, 25775139581491, 797824620178041, 26592701386533766, 949705032131053201, 36181186751341438473, 1464760631695118359051, 62798619981256526628136 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS FORMULA E.g.f.: exp(A(x)) where A(x) is the e.g.f. for A036774. a(n) ~ sqrt(2-sqrt(2)) * (1+sqrt(2))^(n+1) * exp(sqrt(2)-n) * n^(n-1). - Vaclav Kotesovec, Sep 25 2013 MATHEMATICA u=(1-x-((x-1)^2-2x^2)^(1/2))/x; Range[0, 20]! CoefficientList[Series[Exp[u], {x, 0, 20}], x] CROSSREFS Sequence in context: A132070 A121629 A351218 * A141625 A053588 A295928 Adjacent sequences: A200790 A200791 A200792 * A200794 A200795 A200796 KEYWORD nonn AUTHOR Geoffrey Critzer, Nov 22 2011 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified March 30 07:09 EDT 2023. Contains 361606 sequences. (Running on oeis4.)