Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038057
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038057 a(n) = 2^n*n^(n-1). +0
3
2, 8, 72, 1024, 20000, 497664, 15059072, 536870912, 22039921152, 1024000000000, 53119845582848, 3043362286338048, 190857913323364352, 13004222844995895296, 956593800000000000000, 75557863725914323419136 (list; graph; listen)
OFFSET

1,1

COMMENT

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: A026739 A060635 A009478 this_sequence A005615 A107270 A125814

Adjacent sequences: A038054 A038055 A038056 this_sequence 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

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research