login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A288268 Expansion of e.g.f.: exp(Sum_{k>=1} (k-1)*x^k/k). 8

%I #42 May 27 2023 02:34:42

%S 1,0,1,4,21,136,1045,9276,93289,1047376,12975561,175721140,2581284541,

%T 40864292184,693347907421,12548540320876,241253367679185,

%U 4909234733857696,105394372192969489,2380337795595885156,56410454014314490981,1399496554158060983080

%N Expansion of e.g.f.: exp(Sum_{k>=1} (k-1)*x^k/k).

%H Seiichi Manyama, <a href="/A288268/b288268.txt">Table of n, a(n) for n = 0..444</a>

%H <a href="/index/La#Laguerre">Index entries for sequences related to Laguerre polynomials</a>

%F a(0) = 1 and a(n) = (n-1)! * Sum_{k=1..n} (k-1)*a(n-k)/(n-k)! for n > 0.

%F E.g.f.: (1 - x) * exp(x/(1 - x)). - _Ilya Gutkovskiy_, Jul 27 2020

%F a(n) = (n!/(n-1))*( 2*LaguerreL(n-1, -1) - LaguerreL(n, -1) ) with a(0) = 1, a(1) = 0. - _G. C. Greubel_, Mar 10 2021

%F a(n) ~ n^(n - 3/4) * exp(-1/2 + 2*sqrt(n) - n) / sqrt(2) * (1 - 65/(48*sqrt(n))). - _Vaclav Kotesovec_, Mar 10 2021, minor term corrected Dec 01 2021

%F From _Peter Luschny_, Feb 20 2022: (Start)

%F a(n) = n! * Sum_{k=0..n} (-1)^k * LaguerreL(n-k, k-1, -1).

%F a(n) = 2*(n - 1)*a(n - 1) - (n^2 - 4*n + 3)*a(n - 2) for n >= 3. (End)

%F From _Peter Bala_, May 26 2023: (Start)

%F a(n) = Sum_{k = 0..n} |Stirling1(n,k)|*A000296(k) (follows from the fundamental theorem of Riordan arrays).

%F Let k be a positive integer. The sequence obtained by reducing a(n) modulo k is purely periodic with the period dividing k. For example, modulo 7 we obtain the purely periodic sequence [1, 0, 1, 4, 0, 3, 2, 1, 0, 1, 4, 0, 3, 2, ...] of period 7. Cf. A047974. (End)

%F For n>1, a(n) = (2*n*A002720(n-1) - A002720(n))/(n-1). - _Vaclav Kotesovec_, May 27 2023

%p a := proc(n) option remember; if n < 3 then [1, 0, 1][n+1] else

%p -(n^2 - 4*n + 3)*a(n - 2) + (2*n - 2)*a(n - 1) fi end:

%p seq(a(n), n = 0..21); # _Peter Luschny_, Feb 20 2022

%t Table[If[n<2, 1-n, (n!/(n-1))*(2*LaguerreL[n-1, -1] - LaguerreL[n, -1])], {n, 0, 30}] (* _G. C. Greubel_, Mar 10 2021 *)

%o (PARI) {a(n) = n!*polcoeff(exp(sum(k=1, n, (k-1)*x^k/k)+x*O(x^n)), n)}

%o (Magma)

%o l:= func< n, a, b | Evaluate(LaguerrePolynomial(n, a), b) >;

%o [1,0]cat[(Factorial(n)/(n-1))*(2*l(n-1,0,-1) - l(n,0,-1)): n in [2..30]]; // _G. C. Greubel_, Mar 10 2021

%o (Sage) [1-n if n<2 else (factorial(n)/(n-1))*(2*gen_laguerre(n-1,0,-1) - gen_laguerre(n,0,-1)) for n in (0..30)] # _G. C. Greubel_, Mar 10 2021

%Y Cf. A000296, A002720, A008275, A009940, A052852, A052887, A059114, A288269.

%K nonn,easy

%O 0,4

%A _Seiichi Manyama_, Oct 20 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 03:41 EDT 2024. Contains 371264 sequences. (Running on oeis4.)