|
%I #54 Sep 08 2022 08:44:59
%S 1,0,2,3,16,65,336,1897,11824,80145,586000,4588001,38239224,337611001,
%T 3144297352,30779387745,315689119456,3383159052833,37790736663456,
%U 439036039824193,5294386116882280,66155074120062921,855156188538926296,11418964004032623809
%N Expansion of e.g.f. exp(x*exp(x)-x).
%C a(n) is the number of forests of rooted labeled trees with height exactly one. Equivalently, the number of idempotent mappings from {1,2,...,n} into {1,2,...,n} where each fixed point has at least one (other than itself) element mapped to it. See the second summation formula provided by Vladeta Jovovic with conditions on k, the number of fixed points. - _Geoffrey Critzer_, Sep 20 2012
%H Vincenzo Librandi, <a href="/A052506/b052506.txt">Table of n, a(n) for n = 0..200</a>
%H INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=39">Encyclopedia of Combinatorial Structures 39</a>
%H Vaclav Kotesovec, <a href="/A216688/a216688.pdf">Asymptotic solution of the equations using the Lambert W-function</a>
%F a(n) = Sum_{k=0..n} binomial(n, k)*(n-k-1)^k. - _Vladeta Jovovic_, Apr 12 2003
%F a(n) = Sum_{k=0..floor(n/2)} binomial(n, k)*k!*Stirling2(n-k, k). - _Vladeta Jovovic_, Dec 19 2004
%F a(n) ~ exp((1-r*(n+r))/(1+r)) * n^(n+1/2) * sqrt(1+r) / (r^n * sqrt((1+r)^3 + n*(1+3*r+r^2))), where r satisfies exp(r)*(1+r) - (1+n)/r = 1. - _Vaclav Kotesovec_, Aug 04 2014
%F (a(n)/n!)^(1/n) ~ exp(1/(2*LambertW(sqrt(n)/2))) / (2*LambertW(sqrt(n)/2)). - _Vaclav Kotesovec_, Aug 06 2014
%F G.f.: Sum_{k>=0} x^k / (1 - (k-1)*x)^(k+1). - _Seiichi Manyama_, Aug 29 2022
%p spec := [S,{S=Set(Tree), Tree=Prod(Z,Set(Z,0 < card))},labeled]: seq(combstruct[count](spec, size=n), n=0..20);
%t nn=20;Range[0,nn]! CoefficientList[Series[Exp[x(Exp[x]-1)], {x,0,nn}], x] (* _Geoffrey Critzer_, Sep 20 2012 *)
%o (PARI) my(x='x+O('x^30)); Vec(serlaplace( exp(x*exp(x)-x) )) \\ _G. C. Greubel_, Nov 15 2017
%o (PARI) my(N=30, x='x+O('x^N)); Vec(sum(k=0, N, x^k/(1-(k-1)*x)^(k+1))) \\ _Seiichi Manyama_, Aug 29 2022
%o (Magma) m:=30; R<x>:=PowerSeriesRing(Rationals(), m); b:=Coefficients(R!( Exp(x*Exp(x)-x) )); [Factorial(n-1)*b[n]: n in [1..m-1]]; // _G. C. Greubel_, May 13 2019
%o (Sage) m = 30; T = taylor(exp(x*exp(x)-x), x, 0, m); [factorial(n)*T.coefficient(x, n) for n in (0..m)] # _G. C. Greubel_, May 13 2019
%Y Cf. A000248, A240989.
%Y Cf. A351736, A351737.
%K easy,nonn
%O 0,3
%A encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
