login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A136719
Number of labeled directed trees with n nodes.
2
1, 3, 27, 432, 10125, 314928, 12252303, 573308928, 31381059609, 1968300000000, 139234453205859, 10968475320188928, 952427511967417317, 90388408459919044608, 9308590679915771484375, 1033947715493982426365952, 123217926482311669202664753, 15682720840457750419215679488
OFFSET
1,2
COMMENTS
A directed tree is a tree where each edge is assigned one or both directions.
REFERENCES
F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, p. 292 (4.1.58).
FORMULA
a(n) = A052756(n)/n.
a(n) = 3*(3*n)^(n-2). - Andrew Howroyd, Feb 02 2020
PROG
(PARI) seq(n)={Vec(serlaplace((-1/3)*lambertw(-3*x + O(x*x^n))/x))} \\ Andrew Howroyd, Feb 02 2020
(PARI) a(n) = {3*(3*n)^(n-2)} \\ Andrew Howroyd, Feb 02 2020
CROSSREFS
Cf. A006965 (unlabeled version).
Sequence in context: A221624 A108525 A379699 * A377361 A279844 A159600
KEYWORD
nonn
AUTHOR
Christian G. Bower, Jan 18 2008
EXTENSIONS
Terms a(16) and beyond from Andrew Howroyd, Feb 02 2020
STATUS
approved