A386657 E.g.f.: Sum_{n>=0} (4^n*x + LambertW(x))^n / n!.

1, 5, 287, 274532, 4362420261, 1131407873777920, 4729288202285254702123, 317048074495318899943286044736, 340323907513179399929311813628104334217, 5846207259092593125133941613189798019292422881280

Offset: 0

Author

Paul D. Hanna, Aug 23 2025

Keywords

• nonn
• new

Comments

Conjecture: for n >= 6, a(n) (mod 6) equals [1, 2, 3, 2, 3, 4] repeating.

In general, the following sums are equal:

(C.1) Sum_{n>=0} (q^n + p)^n * r^n/n!,

(C.2) Sum_{n>=0} q^(n^2) * exp(p*q^n*r) * r^n/n!;

here, q = 4 with p = LambertW(x)/x, r = x.

Examples

			E.g.f.: A(x) = 1 + 5*x + 287*x^2/2! + 274532*x^3/3! + 4362420261*x^4/4! + 1131407873777920*x^5/5! + 4729288202285254702123*x^6/6! + ...
where A(x) = Sum_{n>=0} (4^n*x + LambertW(x))^n / n!.
RELATED SERIES.
LambertW(x) = x - 2*x^2/2! + 3^2*x^3/3! - 4^3*x^4/4! + 5^4*x^5/5! - 6^5*x^6/6! + 7^6*x^7/7! + ... + (-1)^(n-1) * n^(n-1)*x^n/n! + ...
where exp(LambertW(x)) = x/LambertW(x);
also, (x/LambertW(x))^y = Sum_{k>=0} y*(y - k)^(k-1) * x^k/k!.
		

Crossrefs

Cf. A386655 (q=2), A386656 (q=3), A386658 (q=5), A386648.

Programs

PARI

{a(n) = sum(k=0,n, binomial(n,k) * 4^(k*(k+1)) * (4^k - (n-k))^(n-k-1) )}
for(n=0, 12, print1(a(n), ", "))

PARI

{a(n) = my(A = sum(m=0, n, (4^m + lambertw(x +x^3*O(x^n))/x)^m *x^m/m! )+x*O(x^n)); n! * polcoeff(A, n)}
for(n=0, 12, print1(a(n), ", "))

Formula

E.g.f. A(x) = Sum_{n>=0} a(n)*x^n/n! satisfies the following formulas.

(1) A(x) = Sum_{n>=0} (4^n*x + LambertW(x))^n / n!.

(2) A(x) = Sum_{n>=0} 4^(n^2) * exp( LambertW(x) * 4^n ) * x^n / n!.

(3) A(x) = Sum_{n>=0} 4^(n^2) * (x/LambertW(x))^(4^n) * x^n / n!.

(4) A(x) = Sum_{n>=0} 4^(n*(n+1)) * x^n/n! * Sum_{k>=0} (4^n - k)^(k-1) * x^k/k!.

a(n) = Sum_{k=0..n} binomial(n,k) * 4^(k*(k+1)) * (4^k - (n-k))^(n-k-1).

a(n) = Sum_{k=0..n} binomial(n,k) * 4^(n*k) * (1 - (n-k)/4^k)^(n-k-1).