OFFSET
0,3
LINKS
Andrew Howroyd, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (9,-33,63,-66,36,-8).
FORMULA
a(n) = n! * Sum_{k=0..floor(n/2)} k! * binomial(2,k) * Stirling2(n-k,k)/(n-k)!.
From Andrew Howroyd, Nov 13 2025: (Start)
a(n) = n*(n - 1)*2^(n - 2) - 2*n*(n - 2) for n >= 3.
G.f.: (1 - 9*x + 37*x^2 - 93*x^3 + 176*x^4 - 248*x^5 + 212*x^6 - 88*x^7 + 16*x^8)/((1 - x)^3*(1 - 2*x)^3). (End)
PROG
(PARI) a(n) = n!*sum(k=0, n\2, k!*binomial(2, k)*stirling(n-k, k, 2)/(n-k)!);
(PARI) a(n) = if(n < 3, [1, 0, 4][n+1], n*(n-1)*2^(n-2) - 2*n*(n-2)); \\ Andrew Howroyd, Nov 13 2025
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Nov 04 2024
STATUS
approved
