login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038049 Number of labeled rooted trees with 2-colored leaves. 7
2, 4, 24, 224, 2880, 47232, 942592, 22171648, 600698880, 18422374400, 630897721344, 23864653578240, 988197253808128, 44460603225407488, 2159714024218951680, 112652924603290615808, 6280048587936003784704 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

REFERENCES

F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, p. 185 (3.1.83)

LINKS

N. J. A. Sloane, Transforms

Index entries for sequences related to rooted trees

FORMULA

Divides by n and shifts left under exponential transform.

E.g.f.: A(x) = x-LambertW(-x*exp(x)). - Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 08 2003

a(n) = Sum_{k=0..n} (binomial(n, k)*(n-k)^(n-1)).

A(x) = 2*compositional inverse of 2*x/(1+exp(2*x)) - Peter Bala Oct 14 2011

CROSSREFS

Cf. A000169, A029856, A038050, A038054.

Sequence in context: A032107 A141307 A190655 * A151817 A038058 A062531

Adjacent sequences:  A038046 A038047 A038048 * A038050 A038051 A038052

KEYWORD

nonn,eigen

AUTHOR

Christian G. Bower (bowerc(AT)usa.net), Jan 04 1999.

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 03:14 EST 2012. Contains 205694 sequences.