cp's OEIS Frontend

A052746 a(0) = 0; a(n) = (2*n)^(n-1), n > 0.

%I A052746 #53 Aug 15 2023 17:01:51
%S A052746 0,1,4,36,512,10000,248832,7529536,268435456,11019960576,512000000000,
%T A052746 26559922791424,1521681143169024,95428956661682176,
%U A052746 6502111422497947648,478296900000000000000,37778931862957161709568,3189059870763703892770816,286511799958070431838109696
%N A052746 a(0) = 0; a(n) = (2*n)^(n-1), n > 0.
%C A052746 Expansion of inverse of x*exp(2x).
%C A052746 Number of well-colored directed trees on n nodes. Well-colored means, each green vertex has at least a red child, each red vertex has no red child.
%C A052746 Number of labeled rooted directed trees on n nodes.
%H A052746 Robert Israel, <a href="/A052746/b052746.txt">Table of n, a(n) for n = 0..350</a>
%H A052746 Federico Ardila, Matthias Beck, and Jodi McWhirter, <a href="https://arxiv.org/abs/2004.02952">The Arithmetic of Coxeter Permutahedra</a>, arXiv:2004.02952 [math.CO], 2020.
%H A052746 C. Banderier, J.-M. Le Bars, and V. Ravelomanana, <a href="https://arxiv.org/abs/math/0411138">Generating functions for kernels of digraphs</a>, arXiv:math/0411138 [math.CO], 2004.
%H A052746 Theo Douvropoulos, Joel Brewster Lewis, and Alejandro H. Morales, <a href="https://arxiv.org/abs/2308.04751">Hurwitz numbers for reflection groups III: Uniform formulas</a>, arXiv:2308.04751 [math.CO], 2023, see p. 11.
%H A052746 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=702">Encyclopedia of Combinatorial Structures 702</a>
%F A052746 E.g.f.: -1/2*W(-2*x), where W is Lambert's W function.
%F A052746 From _Robert Israel_, Jun 16 2016: (Start)
%F A052746 E.g.f. g(x) satisfies g(x) = x*exp(2*g(x)) and (1-2*g(x)) g'(x) = g(x).
%F A052746 a(n) = (2*n/(n-1)) * Sum_{j=1..n-1} binomial(n-1,j)*a(j)*a(n-j) for n >= 2. (End)
%F A052746 a(n) = [x^n] x/(1 - 2*n*x). - _Ilya Gutkovskiy_, Oct 12 2017
%F A052746 Limit_{n->oo} a(n+1)/(n*a(n)) = 2*e. - _Stefano Spezia_, Mar 12 2023
%p A052746 spec := [S,{B=Set(S),S=Prod(Z,B,B)},labeled]: seq(combstruct[count](spec,size=n), n=0..20);
%t A052746 terms = 19;
%t A052746 A[x_] = -1/2 LambertW[-2 x];
%t A052746 CoefficientList[A[x] + O[x]^terms, x] Range[0, terms-1]! (* _Jean-François Alcover_, Jan 15 2019 *)
%t A052746 Join[{0},Table[(2n)^(n-1),{n,20}]] (* _Harvey P. Dale_, Dec 14 2020 *)
%o A052746 (Sage)[lucas_number1(n, 2*n, 0) for n in range(0, 17)] # _Zerinvary Lajos_, Mar 09 2009
%o A052746 (PARI) a(n)=if(n,(2*n)^(n-1),0) \\ _Charles R Greathouse IV_, Nov 20 2011
%Y A052746 Cf. A019762 (2*e), A038057, A097627.
%K A052746 easy,nonn
%O A052746 0,3
%A A052746 encyclopedia(AT)pommard.inria.fr, Jan 25 2000
%E A052746 New description from _Vladeta Jovovic_, Mar 08 2003