OFFSET
0,4
LINKS
Robert Israel, Table of n, a(n) for n = 0..364
FORMULA
a(n) = Sum_{k=2..n} 4^(n-k) * binomial(k,2) * |Stirling1(n,k)|.
a(n) = Sum_{k=2..n} (4*n-3)^(k-2) * 4^(n-k) * binomial(k,2) * Stirling1(n,k).
E.g.f.: f(x) * log(f(x))^2 / 2, where f(x) = 1/(1 - 4*x)^(1/4).
Conjecture D-finite with recurrence a(n) +3*(-4*n+7)*a(n-1) +(48*n^2-216*n+247)*a(n-2) -(4*n-11)^3*a(n-3)=0. - R. J. Mathar, May 07 2025
Conjecture verified using the differential equation y + (124*x - 31)*y' + (240*x^2 - 120*x + 15)*y'' + (64*x^3 - 48*x^2 + 12*x - 1)*y''' = 0 satisfied by the e.g.f. - Robert Israel, Mar 12 2026
a(n) ~ sqrt(Pi) * 2^(2*n - 5/2) * n^(n - 1/4) * log(n)^2 / (Gamma(1/4) * exp(n)) * (1 + (2*gamma + Pi + 6*log(2))/log(n)), where gamma is the Euler-Mascheroni constant A001620 and Gamma() is the Gamma function. - Vaclav Kotesovec, May 12 2025
MAPLE
A383700 := proc(n)
add((4*n-3)^(k-2) * 4^(n-k) * binomial(k, 2) * stirling1(n, k), k=2..n) ;
end proc:
seq(A383700(n), n=0..60) ; # R. J. Mathar, May 07 2025
PROG
(PARI) a(n) = polcoef(prod(k=0, n-1, x+4*k+1), 2);
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, May 06 2025
STATUS
approved
