The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A036773 Number of labeled rooted trees with a degree constraint: ((5*n)!/(120^n)) * C(5*n+1, n). 3
 1, 6, 13860, 423783360, 70220478968640, 41004669682770393600, 65405789473547026656472320, 240729724316568938710767014707200, 1813083536072533851678174232377806438400, 25541737277107694920826740625991927645705830400 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS L. Takacs, Enumeration of rooted trees and forests, Math. Scientist 18 (1993), 1-10; see Eq. (13) on p. 4 (with r = 5). FORMULA E.g.f. with interpolated zeros: Let G(x) = Sum_{n >= 0} a(n)*x^(5*n + 1)/(5*n + 1)!. Then this e.g.f. satisfies the equation G(x) = x*(1 + G(x)^5/5!). - Petros Hadjicostas, Jun 08 2019 CROSSREFS Cf. A036770, A036771, A036772. Sequence in context: A145720 A093897 A062782 * A007702 A130434 A121571 Adjacent sequences:  A036770 A036771 A036772 * A036774 A036775 A036776 KEYWORD nonn AUTHOR STATUS approved

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

Last modified December 2 03:22 EST 2020. Contains 338865 sequences. (Running on oeis4.)