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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038057 a(n) = 2^n*n^(n-1). 2
2, 8, 72, 1024, 20000, 497664, 15059072, 536870912, 22039921152, 1024000000000, 53119845582848, 3043362286338048, 190857913323364352, 13004222844995895296, 956593800000000000000, 75557863725914323419136 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

COMMENTS

Labeled rooted trees with 2-colored nodes.

LINKS

Index entries for sequences related to rooted trees

FORMULA

E.g.f. B(2x) where B(x) is e.g.f. of A000169.

CROSSREFS

Cf. A000169, A038055-A038062.

Equals 2 * A052746(n).

Sequence in context: A060635 A194499 A009478 * A005615 A107270 A125814

Adjacent sequences:  A038054 A038055 A038056 * A038058 A038059 A038060

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

New description from Vladeta Jovovic (vladeta(AT)eunet.rs), Mar 08 2003

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 13 17:27 EST 2012. Contains 205523 sequences.