OFFSET
1,2
COMMENTS
A060187(n,k) = Sum_{j=1..k} (-1)^(k-j) * binomial(n,k-j) * (2*j-1)^(n-1).
L.g.f. equals the logarithm of the g.f. of A292500.
Conjecture: a(n)^(1/n^2) tends to 3^(1/4). - Vaclav Kotesovec, Oct 17 2020
LINKS
Paul D. Hanna, Table of n, a(n) for n = 1..130
FORMULA
EXAMPLE
L.g.f: A(x) = x + 7*x^2/2 + 43*x^3/3 + 399*x^4/4 + 6091*x^5/5 + 151255*x^6/6 + 6550307*x^7/7 + 465127199*x^8/8 + 58293976795*x^9/9 + 12191724780647*x^10/10 + 4471204259257363*x^11/11 + 2799295142330495151*x^12/12 + 3026340345288168023883*x^13/13 + 5704756586858875194533367*x^14/14 + ...
The l.g.f. A(x) equals the series:
A(x) = Sum_{n>=1} (x + 3^n*x^2 + 5^n*x^3 + ... + (2*k-1)^n*x^k + ...)^n/n,
or,
A(x) = (x + 3*x^2 + 5*x^3 + 7*x^4 + 9*x^5 + ...) +
(x + 3^2*x^2 + 5^2*x^3 + 7^2*x^4 + 9^2*x^5 + ...)^2/2 +
(x + 3^3*x^2 + 5^3*x^3 + 7^3*x^4 + 9^3*x^5 + ...)^3/3 +
(x + 3^4*x^2 + 5^4*x^3 + 7^4*x^4 + 9^4*x^5 + ...)^4/4 + ...
This logarithmic series can be written using the Eulerian numbers of type B like so:
A(x) = (x + x^2) / (1-x)^2 +
(x + 6*x^2 + x^3)^2 / (1-x)^6/2 +
(x + 23*x^2 + 23*x^3 + x^4)^3 / (1-x)^12/3 +
(x + 76*x^2 + 230*x^3 + 76*x^4 + x^5)^4 / (1-x)^20/4 +
(x + 237*x^2 + 1682*x^3 + 1682*x^4 + 237*x^5 + x^6)^5 / (1-x)^30/5 +
(x + 722*x^2 + 10543*x^3 + 23548*x^4 + 10543*x^5 + 722*x^6 + x^7)^6 / (1-x)^42/6 +
(x + 2179*x^2 + 60657*x^3 + 259723*x^4 + 259723*x^5 + 60657*x^6 + 2179*x^7 + x^8)^7 / (1-x)^56/7 + ... +
[ Sum_{k=0..n} A060187(n+1,k+1) * x^k ]^n / (1-x)^(n^2+n) * x^n/n + ...
Exponentiation yields the g.f. of A292500:
exp(A(x)) = 1 + x + 4*x^2 + 18*x^3 + 122*x^4 + 1382*x^5 + 26992*x^6 + 967860*x^7 + 59207134*x^8 + 6539607238*x^9 + 1225903048760*x^10 + 407719392472476*x^11 + 233686070341415140*x^12 + 233030334505100451484*x^13 + 407716349332865096406960*x^14 + ... + A292500(n)*x^n + ...
which is an integer series.
PROG
(PARI) {A060187(n, k) = sum(j=1, k, (-1)^(k-j) * binomial(n, k-j) * (2*j-1)^(n-1))}
{a(n) = my(A=1, Oxn=x*O(x^n));
A = sum(m=1, n+1, sum(k=0, m, A060187(m+1, k+1)*x^k)^m /(1-x +Oxn)^(m^2+m) * x^m/m );
n*polcoeff(A, n)}
for(n=1, 30, print1(a(n), ", "))
(PARI) {a(n) = n*polcoeff( sum(m=1, n+1, sum(k=1, n, (2*k-1)^m * x^k +x*O(x^n))^m/m ), n)}
for(n=1, 30, print1(a(n), ", "))
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Sep 17 2017
STATUS
approved