Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038050
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038050 Number of labeled rooted trees with 3-colored leaves. +0
3
3, 6, 45, 504, 7785, 153468, 3681909, 104126256, 3392064945, 125089571700, 5151335388309, 234322765501608, 11668410187187481, 631335472193760012, 36881146426978035765, 2313552152470193124192, 155107536736245864549345 (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

Index entries for sequences related to rooted trees

N. J. A. Sloane, Transforms

FORMULA

Divides by n and shifts left under exponential transform.

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

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

CROSSREFS

Cf. A000169, A029857.

Cf. A038049.

Sequence in context: A088674 A076170 A137775 this_sequence A032322 A111752 A102931

Adjacent sequences: A038047 A038048 A038049 this_sequence A038051 A038052 A038053

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 December 20 00:58 EST 2009. Contains 171054 sequences.


AT&T Labs Research