%I #19 Aug 17 2017 05:53:50
%S 0,1,27,846,32290,1472535,78444261,4789283212,329976556596,
%T 25336918039005,2145912573891295,198763621138900026,
%U 19988975122377164982,2169175884299414423251,252661578519463668740745,31442098485128401965118680,4163361054820272025075769896
%N Bessel polynomial {y_n}'(4).
%D J. Riordan, Combinatorial Identities, Wiley, 1968, p. 77.
%H G. C. Greubel, <a href="/A065922/b065922.txt">Table of n, a(n) for n = 0..330</a>
%H <a href="/index/Be#Bessel">Index entries for sequences related to Bessel functions or polynomials</a>
%F Recurrence: (n-1)^2*a(n) = (2*n - 1)^3*a(n-1) + n^2*a(n-2). - _Vaclav Kotesovec_, Jul 22 2015
%F a(n) ~ 2^(3*n-3/2) * n^(n+1) / exp(n-1/4). - _Vaclav Kotesovec_, Jul 22 2015
%F From _G. C. Greubel_, Aug 14 2017: (Start)
%F a(n) = 2*n*(1/2)_{n}*8^(n - 1)* hypergeometric1f1(1 - n, -2*n, 1/2).
%F E.g.f.: ((1 - 8*x)^(3/2) + 4*x*(1 - 8*x)^(1/2) + 24*x - 1)* exp((1 - sqrt(1 - 8*x))/4)/(16*(1 - 8*x)^(3/2)). (End)
%F G.f.: (t/(1-t)^3)*hypergeometric2f0(2,3/2; - ; 8*t/(1-t)^2). - _G. C. Greubel_, Aug 16 2017
%t Table[Sum[(n+k+1)!*2^(k-1)/((n-k-1)!*k!), {k,0,n-1}], {n,0,20}] (* _Vaclav Kotesovec_, Jul 22 2015 *)
%t RecurrenceTable[{a[0]==0,a[1]==1,a[n]==((2n-1)^3 a[n-1]+n^2 a[n-2])/ (n-1)^2}, a,{n,20}] (* _Harvey P. Dale_, May 23 2016 *)
%o (PARI) for(n=0,50, print1(sum(k=0,n-1, (n+k+1)!*2^(k-1)/((n-k-1)!*k!)), ", ")) \\ _G. C. Greubel_, Aug 14 2017
%Y Cf. A001514, A065920, A065921.
%K nonn
%O 0,3
%A _N. J. A. Sloane_, Dec 08 2001