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!)
A343896 a(n) = Sum_{k=0..n} (-1)^(n-k) * k! * binomial(n,k) * binomial(2*n+1,k). 2
1, 2, 11, 104, 1405, 24694, 534223, 13719404, 407730041, 13760958410, 519827337331, 21726980525392, 995403499490101, 49600090942276094, 2670566242480261175, 154500457959360271124, 9557826199486960327153, 629586464929967678553874, 43994787057844036765113691 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = (2*n+1)! * Sum_{k=0..n} (-1)^k * binomial(n,k)/(k+n+1)!.
a(n) = n! * Sum_{k=0..n} (-1)^(n-k) * binomial(2*n+1,k)/(n-k)!.
a(n) = n! * LaguerreL(n, n+1, 1).
a(n) = n! * [x^n] exp(-x/(1 - x))/(1 - x)^(n+2).
a(n) ~ 2^(2*n + 3/2) * n^n / exp(n+1). - Vaclav Kotesovec, May 03 2021
MATHEMATICA
a[n_] := n!*LaguerreL[n, n + 1, 1]; Array[a, 19, 0] (* Amiram Eldar, May 11 2021 *)
PROG
(PARI) a(n) = sum(k=0, n, (-1)^(n-k)*k!*binomial(n, k)*binomial(2*n+1, k));
(PARI) a(n) = (2*n+1)!*sum(k=0, n, (-1)^k*binomial(n, k)/(k+n+1)!);
(PARI) a(n) = n!*sum(k=0, n, (-1)^(n-k)*binomial(2*n+1, k)/(n-k)!);
(PARI) a(n) = n!*pollaguerre(n, n+1, 1);
CROSSREFS
Sequence in context: A099713 A277461 A277470 * A111535 A268294 A364338
KEYWORD
nonn
AUTHOR
Seiichi Manyama, May 03 2021
STATUS
approved

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 July 12 20:37 EDT 2024. Contains 374252 sequences. (Running on oeis4.)