login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A346626
G.f. A(x) satisfies: A(x) = (1 + x * A(x)^3) / (1 - x).
25
1, 2, 8, 44, 280, 1936, 14128, 107088, 834912, 6652608, 53934080, 443467136, 3689334272, 30997608960, 262651640064, 2241857334528, 19257951946240, 166362924583936, 1444351689281536, 12595885932259328, 110287974501355520, 969178569410404352, 8544982917273509888, 75565732555028701184
OFFSET
0,2
COMMENTS
Partial sums of A213282.
LINKS
FORMULA
G.f.: Sum_{k>=0} ( binomial(3*k,k) / (2*k + 1) ) * x^k / (1 - x)^(3*k+1).
a(0) = 1; a(n) = a(n-1) + Sum_{i=0..n-1} Sum_{j=0..n-i-1} a(i) * a(j) * a(n-i-j-1).
a(n) ~ 2^(n - 1/2) / (sqrt(3*Pi*(2 - (2 - sqrt(2))^(1/3)/2^(2/3) - 1/(2*(2 - sqrt(2)))^(1/3))) * n^(3/2) * (2 - 3/(sqrt(2) - 1)^(1/3) + 3*(sqrt(2) - 1)^(1/3))^n). - Vaclav Kotesovec, Nov 04 2021
a(n) = (1/n) * Sum_{k=0..floor((n-1)/2)} 2^(n-k) * binomial(n,k) * binomial(2*n-k,n-1-2*k) for n > 0. - Seiichi Manyama, Apr 01 2024
MATHEMATICA
nmax = 23; A[_] = 0; Do[A[x_] = (1 + x A[x]^3)/(1 - x) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
nmax = 23; CoefficientList[Series[Sum[(Binomial[3 k, k]/(2 k + 1)) x^k/(1 - x)^(3 k + 1), {k, 0, nmax}], {x, 0, nmax}], x]
a[0] = 1; a[n_] := a[n] = a[n - 1] + Sum[Sum[a[i] a[j] a[n - i - j - 1], {j, 0, n - i - 1}], {i, 0, n - 1}]; Table[a[n], {n, 0, 23}]
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Jul 25 2021
STATUS
approved