login
A200718
G.f. satisfies A(x) = (1 + x*A(x)^2) * (1 + x^2*A(x)^6).
13
1, 1, 3, 14, 75, 433, 2636, 16668, 108399, 720431, 4871555, 33409042, 231817448, 1624503716, 11480658056, 81731416480, 585579734959, 4219179476875, 30552067317233, 222225174139730, 1622894404239115, 11894991079960721, 87472260252499560, 645183802300787356, 4771926560361458884
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)).
LINKS
Vaclav Kotesovec, Recurrence (of order 6)
FORMULA
G.f. A(x) satisfies:
(1) A(x) = sqrt( (1/x)*Series_Reversion( 2*x^5*(1+x)^2/(1 - 2*x^2*(1+x)^2 - sqrt(1 - 4*x^2*(1+x)^2)) ) ).
(2) A(x) = G(x*A(x)^2) where G(x) = A(x/G(x)^2) is the g.f. of A104545 (Motzkin paths of length n having no consecutive (1,0) steps).
(3) A(x) = exp( Sum_{n>=1} x^n * A(x)^n/n * [Sum_{k=0..n} C(n,k)^2 * x^k * A(x)^(4*k)] ).
(4) A(x) = exp( Sum_{n>=1} x^n * A(x)^n/n * [(1-x/A(x)^4)^(2*n+1) * Sum_{k>=0} C(n+k,k)^2*x^k * A(x)^(4*k)] ).
a(n) = Sum_{k=0..floor(n/2)}((binomial(2*n+2*k+1,k)*binomial(2*n+2*k+1,n-2*k))/(2*n+2*k+1)). - Vladimir Kruchinin, Mar 11 2016
EXAMPLE
G.f.: A(x) = 1 + x + 3*x^2 + 14*x^3 + 75*x^4 + 433*x^5 + 2636*x^6 +...
Related expansions:
A(x)^2 = 1 + 2*x + 7*x^2 + 34*x^3 + 187*x^4 + 1100*x^5 + 6784*x^6 +...
A(x)^6 = 1 + 6*x + 33*x^2 + 194*x^3 + 1200*x^4 + 7674*x^5 + 50317*x^6 +...
A(x)^8 = 1 + 8*x + 52*x^2 + 336*x^3 + 2210*x^4 + 14776*x^5 + 100216*x^6 +...
where A(x) = 1 + x*A(x)^2 + x^2*A(x)^6 + x^3*A(x)^8.
The logarithm of the g.f. A = A(x) equals the series:
log(A(x)) = (1 + x*A^4)*x*A + (1 + 2^2*x*A^4 + x^2*A^8)*x^2*A^2/2 +
(1 + 3^2*x*A^4 + 3^2*x^2*A^8 + x^3*A^12)*x^3*A^3/3 +
(1 + 4^2*x*A^4 + 6^2*x^2*A^8 + 4^2*x^3*A^12 + x^4*A^16)*x^4*A^4/4 +
(1 + 5^2*x*A^4 + 10^2*x^2*A^8 + 10^2*x^3*A^12 + 5^2*x^4*A^16 + x^5*A^20)*x^5*A^5/5 + ...
The g.f. of A104545, G(x) = A(x/G(x)^2) where A(x) = G(x*A(x)^2), begins:
G(x) = 1 + x + x^2 + 3*x^3 + 5*x^4 + 11*x^5 + 25*x^6 + 55*x^7 + 129*x^8 +...
MATHEMATICA
a[n_] := Sum[Binomial[2*n + 2*k + 1, k]*Binomial[2*n + 2*k + 1, n - 2*k]/ (2*n + 2*k + 1), {k, 0, n/2}];
Table[a[n], {n, 0, 24}] (* Jean-François Alcover, Jan 09 2018, after Vladimir Kruchinin *)
PROG
(PARI) {a(n)=polcoeff(sqrt( (1/x)*serreverse( 2*x^5*(1+x)^2/(1 - 2*x^2*(1+x)^2 - sqrt(1 - 4*x^2*(1+x)^2+O(x^(n+6)))) ) ), n)}
(PARI) {a(n)=local(p=1, q=4, 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=1, q=4, 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=1, q=4, 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)}
(Maxima)
a(n):=sum((binomial(2*n+2*k+1, k)*binomial(2*n+2*k+1, n-2*k))/(2*n+2*k+1), k, 0, (n)/2); /* Vladimir Kruchinin, Mar 11 2016 */
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Nov 21 2011
STATUS
approved