OFFSET
0,3
COMMENTS
This sequence is obtained from the generalized Euler transform in A266964 by taking f(n) = -1, g(n) = -(2^n - 1).
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 0..600
Seiichi Manyama, Generalized Euler transform.
FORMULA
a(n) = Sum_{k=0..n} 2^k * A382975(k,n-k).
a(n) ~ A048651 * 2^(n-1) * exp(Pi*sqrt(n/3)) / (3^(1/4) * n^(3/4)). - Vaclav Kotesovec, Apr 13 2025
MATHEMATICA
n=31; CoefficientList[Normal@Series[Product[(1+(2^k-1) x^k), {k, 1, n}], {x, 0, n}], x] (* Vincenzo Librandi, Apr 11 2025 *)
PROG
(PARI) f(n) = -1;
g(n) = -(2^n-1);
a_vector(n) = my(b=vector(n, k, sumdiv(k, d, d*f(d)*g(d)^(k/d))), v=vector(n+1)); v[1]=1; for(i=1, n, v[i+1]=sum(j=1, i, b[j]*v[i-j+1])/i); v;
(Magma) n := 31; R<x> := PowerSeriesRing(Rationals(), n+1); f := &*[ (1 + (2^k - 1)*x^k) : k in [1..n] ]; coeffs := [Coefficient(f, i) : i in [0..n]]; coeffs; // Vincenzo Librandi, Apr 11 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Apr 11 2025
STATUS
approved
