The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A038058 Number of labeled trees with 2-colored nodes. 3
 1, 2, 4, 24, 256, 4000, 82944, 2151296, 67108864, 2448880128, 102400000000, 4829076871168, 253613523861504, 14681377947951104, 928873060356849664, 63772920000000000000, 4722366482869645213696, 375183514207494575620096 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Robert Israel, Table of n, a(n) for n = 0..321 FORMULA a(n) = A038057(n)/n = 2^n * n^(n-2) for n>=1. E.g.f. B(2*x) where B(x) is e.g.f. of A000272. MAPLE 1, seq(2^n * n^(n-2), n=1..20); # Robert Israel, Nov 02 2014 MATHEMATICA nn = 17; f[x_] := Sum[n^(n - 2) x^n/n!, {n, 1, nn}]; Range[0, nn]! CoefficientList[Series[f[2 x] + 1, {x, 0, nn}], x] (* Geoffrey Critzer, Nov 02 2014 *) CROSSREFS Cf. A000272, A038055-A038062. Sequence in context: A038049 A151817 A265937 * A062531 A141599 A047677 Adjacent sequences:  A038055 A038056 A038057 * A038059 A038060 A038061 KEYWORD nonn AUTHOR Christian G. Bower, Jan 04 1999 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 22 00:42 EDT 2020. Contains 337276 sequences. (Running on oeis4.)