OFFSET
0,5
LINKS
Robert Israel, Table of n, a(n) for n = 0..365
FORMULA
a(n) = Sum_{k=3..n} 4^(n-k) * binomial(k,3) * |Stirling1(n,k)|.
a(n) = Sum_{k=3..n} (4*n-3)^(k-3) * 4^(n-k) * binomial(k,3) * Stirling1(n,k).
E.g.f.: f(x) * log(f(x))^3 / 6, where f(x) = 1/(1 - 4*x)^(1/4).
Conjecture D-finite with recurrence a(n) +4*(-4*n+9)*a(n-1) +2*(48*n^2-264*n+371)*a(n-2) -4*(4*n-13)*(16*n^2-104*n+173)*a(n-3) +(4*n-15)^4*a(n-4)=0. - R. J. Mathar, May 07 2025
Conjecture confirmed using differential equation y + (624*x - 156)*y' + (2656*x^2 - 1328*x + 166)*y'' + (1792*x^3 - 1344*x^2 + 336*x - 28)*y''' + (256*x^4 - 256*x^3 + 96*x^2 - 16*x + 1)*y'''' satisfied by the e.g.f. - Robert Israel, Mar 12 2026
MAPLE
f:= gfun:-rectoproc({(4*n + 1)^4*a(n) - 4*a(n + 1)*(4*n + 3)*(16*n^2 + 24*n + 13) + 2*(48*n^2 + 120*n + 83)*a(n + 2) - 4*a(n + 3)*(4*n + 7) + a(n + 4), a(0) = 0, a(1) = 0, a(2) = 0, a(3) = 1}, a(n), remember):
map(f, [$0..20]); # Robert Israel, Mar 12 2026
PROG
(PARI) a(n) = polcoef(prod(k=0, n-1, x+4*k+1), 3);
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, May 06 2025
STATUS
approved
