The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A211249 G.f. satisfies: A(x) = (1 + x*A(x)^3) * (1 + x^2*A(x)^5). 1
1, 1, 4, 21, 126, 819, 5611, 39900, 291719, 2179181, 16560175, 127617168, 994951887, 7833555324, 62196300997, 497425570173, 4003607595960, 32404662671330, 263586896132154, 2153631763231319, 17666722629907960, 145449082369322208, 1201414340736684702 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
More generally, for fixed parameters p and q, if F(x) satisfies:
F(x) = exp( Sum_{n>=1} x^n * F(x)^(n*p)/n * [Sum_{k=0..n} C(n,k)^2 * x^k * F(x)^(k*q)] ),
then F(x) = (1 + x*F(x)^(p+1))*(1 + x^2*F(x)^(p+q+1)); here p=2 and q=2.
LINKS
FORMULA
G.f.: sqrt( (1/x)*Series_Reversion( x*(1-2*x-x^2+x^4 + (1-x-x^2)*sqrt( (1+x+x^2)*(1-3*x+x^2) ))/2 ) ).
G.f. A(x) satisfies:
(1) A(x) = (1/x)*Series_Reversion(x/G(x)) where A(x) = G(x*A(x)) and A(x/G(x)) = G(x) is the g.f. of A200075.
(2) A(x) = sqrt( (1/x)*Series_Reversion( x/G(x)^2 ) ) where A(x) = G(x*A(x)^2) and G(x) = A(x/G(x)^2) and 1+x*G(x) is the g.f. of A004148.
(3) A(x) = exp( Sum_{n>=1} [Sum_{k=0..n} C(n,k)^2 * x^k*A(x)^(2*k)] * x^n*A(x)^(2*n)/n ).
(4) A(x) = exp( Sum_{n>=1} [(1-x*A(x)^2)^(2*n+1)*Sum_{k>=0} C(n+k,k)^2*x^k*A(x)^(2*k) )] * x^n*A(x)^(2*n)/n ).
a(n) ~ s * sqrt((1 + 2*r*s^2 + 3*r^2*s^5) / (Pi*(3 + 10*r*s^2 + 28*r^2*s^5))) / (2*n^(3/2)*r^n), where r = 0.1130413665724951344267888513870607581680912144315... and s = 1.385648922830296011590145919380626723251960276539... are real roots of the system of equations (1 + r*s^3)*(1 + r^2*s^5) = s, r*s^2*(3 + 5*r*s^2 + 8*r^2*s^5) = 1. - Vaclav Kotesovec, Nov 22 2017
EXAMPLE
G.f.: A(x) = 1 + x + 4*x^2 + 21*x^3 + 126*x^4 + 819*x^5 + 5611*x^6 +...
where A( x*(1-x-x^3)^2/(1+x^2)^2 ) = (1+x^2)/(1-x-x^3).
Related expansions:
A(x)^3 = 1 + 3*x + 15*x^2 + 88*x^3 + 564*x^4 + 3828*x^5 + 27040*x^6 +...
A(x)^5 = 1 + 5*x + 30*x^2 + 195*x^3 + 1335*x^4 + 9486*x^5 + 69305*x^6 +...
A(x)^8 = 1 + 8*x + 60*x^2 + 448*x^3 + 3374*x^4 + 25704*x^5 +...
where A(x) = 1 + x*A(x)^3 + x^2*A(x)^5 + x^3*A(x)^8.
The logarithm of the g.f. equals the series:
log(A(x)) = (1 + x*A(x)^2)*x*A(x)^2 +
(1 + 2^2*x*A(x)^2 + x^2*A(x)^4)*x^2*A(x)^4/2 +
(1 + 3^2*x*A(x)^2 + 3^2*x^2*A(x)^4 + x^3*A(x)^6)*x^3*A(x)^6/3 +
(1 + 4^2*x*A(x)^2 + 6^2*x^2*A(x)^4 + 4^2*x^3*A(x)^6 + x^4*A(x)^8)*x^4*A(x)^8/4 +
(1 + 5^2*x*A(x)^2 + 10^2*x^2*A(x)^4 + 10^2*x^3*A(x)^6 + 5^2*x^4*A(x)^8 + x^5*A(x)^10)*x^5*A(x)^10/5 +
(1 + 6^2*x*A(x)^2 + 15^2*x^2*A(x)^4 + 20^2*x^3*A(x)^6 + 15^2*x^4*A(x)^8 + 6^2*x^5*A(x)^10 + x^6*A(x)^12)*x^6*A(x)^12/6 +...
more explicitly,
log(A(x)) = x + 7*x^2/2 + 52*x^3/3 + 403*x^4/4 + 3211*x^5/5 + 26050*x^6/6 +...
MATHEMATICA
CoefficientList[Sqrt[1/x * InverseSeries[Series[x*(1-2*x-x^2+x^4 + (1-x-x^2) * Sqrt[(1+x+x^2)*(1-3*x+x^2)])/2, {x, 0, 20}], x]], x] (* Vaclav Kotesovec, Nov 22 2017 *)
PROG
(PARI) {a(n)=polcoeff(sqrt( (1/x)*serreverse( x*(1-2*x-x^2+x^4 + (1-x-x^2)*sqrt( (1+x+x^2)*(1-3*x+x^2) +x*O(x^n)))/2 ) ), n)}
for(n=0, 30, print1(a(n), ", "))
(PARI) {a(n)=local(p=2, q=2, A=1+x); for(i=1, n, A=(1+x*A^(p+1))*(1+x^2*A^(p+q+1))+x*O(x^n)); polcoeff(A, n)}
(PARI) {a(n)=local(p=2, q=2, A=1+x); for(i=1, n, A=exp(sum(m=1, n, x^m*(A+x*O(x^n))^(p*m)/m*sum(j=0, m, binomial(m, j)^2*x^j*(A+x*O(x^n))^(q*j))))); polcoeff(A, n, x)}
(PARI) {a(n)=local(p=2, q=2, A=1+x); for(i=1, n, A=exp(sum(m=1, n, x^m*(A+x*O(x^n))^(p*m)/m*(1-x*A^q)^(2*m+1)*sum(j=0, n, binomial(m+j, j)^2*x^j*(A+x*O(x^n))^(q*j))))); polcoeff(A, n, x)}
CROSSREFS
Sequence in context: A162480 A275758 A003168 * A185047 A353608 A032326
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Apr 05 2012
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 8 04:51 EDT 2024. Contains 373207 sequences. (Running on oeis4.)