OFFSET
0,3
COMMENTS
Conjecture: Euler transform of A003239. - Georg Fischer, Dec 10 2020
LINKS
Alois P. Heinz, Table of n, a(n) for n = 0..1669 (first 401 terms from Paul D. Hanna)
FORMULA
a(n) ~ c * 4^n / n^(3/2), where c = 1/sqrt(Pi) * Product_{j>=1} (2^(j+1) * (2^j - sqrt(4^j - 1))) = 0.6176761088360252844346512553859... - Vaclav Kotesovec, Jun 18 2019, updated Aug 12 2019
G.f.: Product_{j>=1} c(x^j), where c(x) = (1-sqrt(1-4*x))/(2*x) is the g.f. of A000108. - Alois P. Heinz, Aug 24 2019
EXAMPLE
G.f.: A(x) = 1 + x + 3*x^2 + 7*x^3 + 20*x^4 + 54*x^5 + 168*x^6 + 518*x^7 + 1702*x^8 + 5672*x^9 + 19413*x^10 + 67329*x^11 + 236994*x^12 + ...
such that
log( A(x) ) = x + 5*x^2/2 + 13*x^3/3 + 45*x^4/4 + 131*x^5/5 + 497*x^6/6 + 1723*x^7/7 + 6525*x^8/8 + 24349*x^9/9 + 92655*x^10/10 + ... + A322203(n)*x^n/n + ...
Also,
A(x)^2 = 1 + 2*x + 7*x^2 + 20*x^3 + 63*x^4 + 190*x^5 + 613*x^6 + 1976*x^7 + 6604*x^8 + 22368*x^9 + 77270*x^10 + 270208*x^11 + 956780*x^12 + ... + A322202(n)*x^n + ...
MAPLE
C:= proc(n) option remember; binomial(2*n, n)/(n+1) end:
b:= proc(n, i) option remember; `if`(n=0 or i=1, C(n),
add((t-> b(t, min(t, i-1)))(n-i*j)*C(j), j=0..n/i))
end:
a:= n-> b(n$2):
seq(a(n), n=0..35); # Alois P. Heinz, Aug 24 2019
MATHEMATICA
nmax = 25; CoefficientList[Series[Product[Sum[CatalanNumber[k]*x^(j*k), {k, 0, nmax/j}], {j, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Aug 12 2019 *)
nmax = 25; CoefficientList[Series[Product[(1 - Sqrt[1 - 4*x^k])/(2*x^k), {k, 1, nmax}], {x, 0, nmax}], x] (* Vaclav Kotesovec, Aug 12 2019 *)
PROG
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Nov 30 2018
STATUS
approved