OFFSET
0,3
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..400
FORMULA
a(n) = n! * Sum_{k=0..floor(n/2)} binomial(k+1,n-2*k)/k!.
From Vaclav Kotesovec, Oct 21 2025: (Start)
Recurrence: n*a(n) = a(n-1) + (n-1)*(2*n-1)*a(n-2) + 3*(n-2)*(n-1)*(n+1)*a(n-3).
a(n) ~ 3^(n/3 - 5/6) * n^(2*n/3 + 1/3) * exp(4/81 - 2*3^(-7/3)*n^(1/3) + 3^(-2/3)*n^(2/3) - 2*n/3) * (1 + 1924*3^(1/3)/(2187*n^(1/3))). (End)
MATHEMATICA
nmax = 25; CoefficientList[Series[(1+x) * E^(x^2*(1+x)), {x, 0, nmax}], x] * Range[0, nmax]! (* Vaclav Kotesovec, Oct 21 2025 *)
Table[n!*Sum[Binomial[k+1, n-2*k]/k!, {k, 0, Floor[n/2]}], {n, 0, 25}] (* Vincenzo Librandi, Oct 27 2025 *)
PROG
(PARI) a(n) = n!*sum(k=0, n\2, binomial(k+1, n-2*k)/k!);
(Magma) [Factorial(n) * &+[Binomial(k+1, n-2*k) / Factorial(k) : k in [0..Floor(n/2)]] : n in [0..25] ]; // Vincenzo Librandi, Oct 27 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Oct 12 2025
STATUS
approved
