Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038049
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038049 Number of labeled rooted trees with 2-colored leaves. +0
8
2, 4, 24, 224, 2880, 47232, 942592, 22171648, 600698880, 18422374400, 630897721344, 23864653578240, 988197253808128, 44460603225407488, 2159714024218951680, 112652924603290615808, 6280048587936003784704 (list; graph; listen)
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.: x-LambertW(-x*exp(x)). - Vladeta Jovovic (vladeta(AT)Eunet.yu), Mar 08 2003

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

CROSSREFS

Cf. A000169, A029856, A038050, A038054.

Sequence in context: A121892 A032107 A141307 this_sequence A038058 A062531 A047677

Adjacent sequences: A038046 A038047 A038048 this_sequence A038050 A038051 A038052

KEYWORD

nonn,eigen

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research