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!)
A346224 a(n) = (n!)^2 * Sum_{k=0..floor(n/2)} 1 / ((n-2*k)! * 4^k * k!). 0
1, 1, 3, 15, 114, 1170, 15570, 256410, 5103000, 119773080, 3264445800, 101784097800, 3591396824400, 141958074258000, 6236035482877200, 302218901402418000, 16060366291617648000, 930654556409161584000, 58524794739862410960000, 3976525824684785163792000 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
Sum_{n>=0} a(n) * x^n / (n!)^2 = exp( x + x^2 / 4 ).
a(n) = n! * Sum_{k=0..n} Stirling1(n,k) * Bell(k) / 2^(n-k).
D-finite with recurrence a(0) = a(1) = 1; a(n) = n * a(n-1) + n * (n-1)^2 * a(n-2) / 2.
a(n) ~ sqrt(Pi) * n^((3*n + 1)/2) / (2^(n/2) * exp((3*n + 1)/2 - sqrt(2*n))). - Vaclav Kotesovec, Jul 17 2021
MATHEMATICA
Table[(n!)^2 Sum[1/((n - 2 k)! 4^k k!), {k, 0, Floor[n/2]}], {n, 0, 19}]
nmax = 19; CoefficientList[Series[Exp[x + x^2/4], {x, 0, nmax}], x] Range[0, nmax]!^2
PROG
(PARI) a(n) = (n!)^2 * sum(k=0, n\2, 1/((n-2*k)!*4^k*k!)); \\ Michel Marcus, Jul 17 2021
CROSSREFS
Sequence in context: A357794 A335531 A166885 * A082163 A331122 A342167
KEYWORD
nonn,easy
AUTHOR
Ilya Gutkovskiy, Jul 16 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 August 14 16:54 EDT 2024. Contains 375166 sequences. (Running on oeis4.)