|
%I #40 Sep 08 2022 08:45:01
%S 0,2,6,36,320,3750,54432,941192,18874368,430467210,11000000000,
%T 311249095212,9659108818944,326173191714734,11905721598812160,
%U 467086816406250000,19599665578316398592,875901453762003632658,41532319635035234107392,2082547005958224830656820
%N Total number of leaves (nodes of vertex degree 1) in all labeled trees with n nodes.
%C Equivalently, a(n) is the number of rooted labeled trees such that the root node has degree 1. - _Geoffrey Critzer_, Feb 07 2012
%H G. C. Greubel, <a href="/A055541/b055541.txt">Table of n, a(n) for n = 1..385</a>
%H Dixy Msapato, <a href="https://arxiv.org/abs/2002.12194">Counting the number of tau-exceptional sequences over Nakayama algebras</a>, arXiv:2002.12194 [math.RT], 2020.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/TreeLeaf.html">Tree Leaf.</a>
%H <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%F From _Vladeta Jovovic_, Mar 31 2001: (Start)
%F a(n) = n*(n-1)^(n-2), n > 1.
%F E.g.f.: -x*LambertW(-x). (End)
%F a(n) = Sum_{k=1..n} (A055314(n, k)*k). - _Christian G. Bower_, Jun 12 2000
%F E.g.f.: x*T(x) where T(x) is the e.g.f. for A000169. - _Geoffrey Critzer_, Feb 07 2012
%t Join[{0,2}, Table[Sum[n!/k! StirlingS2[n-2,n-k] k, {k,2,n-1}], {n,3,20}]] (* _Geoffrey Critzer_, Nov 22 2011 *)
%t Join[{0,2}, Table[n*(n-1)^(n-2), {n,3,50}]] (* or *) Rest[With[{nmax = 40}, CoefficientList[Series[-x*LambertW[-x], {x, 0, nmax}], x]*Range[0, nmax]!]] (* _G. C. Greubel_, Nov 11 2017 *)
%o (PARI) for(n=1, 30, print1(if(n==1, 0, if(n==2, 2, n*(n-1)^(n-2))), ", ")) \\ _G. C. Greubel_, Nov 11 2017
%o (Magma) [0,2] cat [n*(n-1)^(n-2): n in [3..10]]; // _G. C. Greubel_, Nov 11 2017
%Y Cf. A003227, A003228, A055314, A055540, A055897.
%Y Essentially the same as A061302.
%K nonn
%O 1,2
%A _Eric W. Weisstein_
%E More terms from _Christian G. Bower_, Jun 12 2000
|
