This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A038052 Number of labeled trees of nonempty sets with n points. (Each node is a set of 1 or more points.) 7

%I

%S 1,1,2,7,42,376,4513,68090,1238968,26416729,646140364,17837852044,

%T 548713088399,18612963873492,690271321314292,27785827303491579,

%U 1206582732097720126,56224025231569020724,2798445211000659147033

%N Number of labeled trees of nonempty sets with n points. (Each node is a set of 1 or more points.)

%H T. D. Noe, <a href="/A038052/b038052.txt">Table of n, a(n) for n = 0..100</a>

%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>

%F E.g.f.: B(e^x-1) where B is e.g.f. of A000272.

%F a(n) = Sum_{k=1..n} Stirling2(n, k)*k^(k-2). - _Vladeta Jovovic_, Sep 20 2003

%F a(n) ~ (1+exp(1))^(3/2) * n^(n-2) / (exp(n) * (log(1+exp(-1)))^(n-3/2)). - _Vaclav Kotesovec_, Feb 17 2017

%t a[0] = 1; a[n_] := Sum[StirlingS2[n, k]*k^(k - 2), {k, 1, n}]; Table[a[n], {n, 0, 18}] (* _Jean-François Alcover_, Sep 09 2013, after _Vladeta Jovovic_ *)

%Y Cf. A036250, A048802.

%K nonn,nice,easy

%O 0,3

%A _Christian G. Bower_, Jan 04 1999

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 December 9 09:21 EST 2019. Contains 329877 sequences. (Running on oeis4.)