Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A038058
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A038058 Number of labeled trees with 2-colored nodes. +0
2
1, 2, 4, 24, 256, 4000, 82944, 2151296, 67108864, 2448880128, 102400000000, 4829076871168, 253613523861504, 14681377947951104, 928873060356849664, 63772920000000000000, 4722366482869645213696, 375183514207494575620096 (list; graph; listen)
OFFSET

0,2

LINKS

Index entries for sequences related to trees

FORMULA

A038057/n. E.g.f. B(2x) where B(x) is e.g.f. of A000272.

CROSSREFS

Cf. A000272, A038055-A038062.

Sequence in context: A141307 A038049 A151817 this_sequence A062531 A141599 A047677

Adjacent sequences: A038055 A038056 A038057 this_sequence A038059 A038060 A038061

KEYWORD

nonn

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 19 12:50 EST 2009. Contains 171053 sequences.


AT&T Labs Research