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!)
A215654 G.f. satisfies: A(x) = (1 + x*A(x)^2) * (1 + x*A(x)^3). 12

%I #50 May 16 2023 12:10:33

%S 1,2,11,81,684,6257,60325,603641,6210059,65272503,697898849,

%T 7566847547,82999675563,919376968734,10269588489433,115548651723889,

%U 1308374198000780,14897993185500455,170482798370871370,1959574731164246402,22614008012647634411,261915716386286916342

%N G.f. satisfies: A(x) = (1 + x*A(x)^2) * (1 + x*A(x)^3).

%C More generally, for fixed parameters p, q, r, and s, if F(x) satisfies:

%C F(x) = (1 + x^r*F(x)^(p+1)) * (1 + x^(r+s)*F(x)^(p+q+1)), then

%C F(x) = exp( Sum_{n>=1} x^(n*r)*F(x)^(n*p)/n * [Sum_{k=0..n} C(n,k)^2 * x^(k*s)*F(x)^(k*q)] ).

%C The radius of convergence of g.f. A(x) is r = 0.08035832347291483065438962031... with A(r) = 1.5393913914574609282262181402132760790902539070... where y=A(r) satisfies 20*y^3 - 38*y^2 + 15*y - 6 = 0.

%C r = 1/(187/300*17^(2/3) + 119/75*17^(1/3) + 1273/300). - _Vaclav Kotesovec_, Sep 17 2013

%C Number of hybrid ternary trees with n internal nodes. [Hong and Park]. - _N. J. A. Sloane_, Mar 26 2014

%H Vincenzo Librandi, <a href="/A215654/b215654.txt">Table of n, a(n) for n = 0..200</a>

%H SeoungJi Hong and SeungKyung Park, <a href="http://dx.doi.org/10.4134/BKMS.2014.51.1.229">Hybrid d-ary trees and their generalization</a>, Bull. Korean Math. Soc. 51 (2014), No. 1, pp. 229-235. See p. 233. - _N. J. A. Sloane_, Mar 26 2014

%H Sheng-liang Yang and Mei-yang Jiang, <a href="https://journal.lut.edu.cn/EN/abstract/abstract528.shtml">Pattern avoiding problems on the hybrid d-trees</a>, J. Lanzhou Univ. Tech., (China, 2023) Vol. 49, No. 2, 144-150. (in Mandarin)

%F G.f. A(x) satisfies:

%F (1) A(x) = sqrt( (1/x)*Series_Reversion( x*(1-x-x^2)^2/(1+x)^2 ) ).

%F (2) A(x) = exp( Sum_{n>=1} x^n*A(x)^n/n * Sum_{k=0..n} C(n,k)^2 * A(x)^k ).

%F (3) A(x) = exp( Sum_{n>=1} x^n*A(x)^(2*n)/n * Sum_{k=0..n} C(n,k)^2 / A(x)^k ).

%F (4) A(x) = Sum_{n>=0} Fibonacci(n+2) * x^n * A(x)^(2*n).

%F (5) A(x) = G(x*A(x)) where G(x) = A(x/G(x)) is the g.f. of A007863 (number of hybrid binary trees with n internal nodes).

%F The formal inverse of g.f. A(x) is (sqrt(1-2*x+5*x^2) - (1+x))/(2*x^3).

%F a(n) = [x^n] ( (1+x)/(1-x-x^2) )^(2*n+1) / (2*n+1).

%F Recurrence: 100*(n-1)*n*(2*n-1)*(2*n+1)*(4913*n^3 - 26877*n^2 + 49912*n - 30480)*a(n) = 2*(n-1)*(2*n-1)*(6254249*n^5 - 40468670*n^4 + 99110119*n^3 - 109861414*n^2 + 52822608*n - 8566560)*a(n-1) - 3*(2343501*n^7 - 22194333*n^6 + 87905623*n^5 - 187987155*n^4 + 233161624*n^3 - 166253172*n^2 + 62010112*n - 8952000)*a(n-2) + 6*(n-2)*(2*n-5)*(3*n-8)*(3*n-4)*(4913*n^3 - 12138*n^2 + 10897*n - 2532)*a(n-3). - _Vaclav Kotesovec_, Sep 17 2013

%F a(n) ~ 1/1020*sqrt(73695 + 11730*17^(2/3) + 28815*17^(1/3)) * (187/300*17^(2/3) + 119/75*17^(1/3) + 1273/300)^n / (n^(3/2)*sqrt(Pi)). - _Vaclav Kotesovec_, Sep 17 2013

%F a(n) = 1/(2*n+1)*Sum_{i=0..n} C(2*n+i,i)*C(2*n+i+1,n-i). - _Vladimir Kruchinin_, Apr 04 2019

%e G.f.: A(x) = 1 + 2*x + 11*x^2 + 81*x^3 + 684*x^4 + 6257*x^5 + 60325*x^6 +...

%e Related expansions.

%e A(x)^2 = 1 + 4*x + 26*x^2 + 206*x^3 + 1813*x^4 + 17032*x^5 +...

%e A(x)^3 = 1 + 6*x + 45*x^2 + 383*x^3 + 3519*x^4 + 34023*x^5 +...

%e A(x)^5 = 1 + 10*x + 95*x^2 + 925*x^3 + 9270*x^4 + 95237*x^5 +...

%e where A(x) = 1 + x*(A(x)^2 + A(x)^3) + x^2*A(x)^5.

%e The g.f. also satisfies the series:

%e A(x) = 1 + 2*x*A(x)^2 + 3*x^2*A(x)^4 + 5*x^3*A(x)^6 + 8*x^4*A(x)^8 + 13*x^5*A(x)^10 + 21*x^6*A(x)^12 + 34*x^7*A(x)^14 +...+ Fibonacci(n+2)*x^n*A(x)^(2*n) +...

%e and consequently, A( x*(1-x-x^2)^2/(1+x)^2 ) = (1+x)/(1-x-x^2).

%e The logarithm of the g.f. equals the series:

%e log(A(x)) = (1 + A(x))*x*A(x) + (1 + 2^2*A(x) + A(x)^2)*x^2*A(x)^2/2 +

%e (1 + 3^2*A(x) + 3^2*A(x)^2 + A(x)^3)*x^3*A(x)^3/3 +

%e (1 + 4^2*A(x) + 6^2*A(x)^2 + 4^2*A(x)^3 + A(x)^4)*x^4*A(x)^4/4 +

%e (1 + 5^2*A(x) + 10^2*A(x)^2 + 10^2*A(x)^3 + 5^2*A(x)^4 + A(x)^5)*x^5*A(x)^5/5 +...

%e Explicitly,

%e log(A(x)) = 2*x + 18*x^2/2 + 185*x^3/3 + 2006*x^4/4 + 22412*x^5/5 + 255249*x^6/6 + 2946155*x^7/7 + 34342270*x^8/8 +...+ L(n)*x^n/n +...

%e where L(n) = [x^n] (1+x)^(2*n)/(1-x-x^2)^(2*n) / 2.

%p a:= n-> coeff(series(RootOf((1+x*A^2)*(1+x*A^3)-A, A), x, n+1), x, n):

%p seq(a(n), n=0..33); # _Alois P. Heinz_, Apr 04 2019

%t CoefficientList[Sqrt[1/x*InverseSeries[Series[x*(1-x-x^2)^2/(1+x)^2,{x,0,20}],x]],x] (* _Vaclav Kotesovec_, Sep 17 2013 *)

%o (PARI) {a(n)=local(A=1+x+x*O(x^n)); for(i=1, n, A=(1 + x*A^2)*(1 + x*A^3)); polcoeff(A, n)}

%o (PARI) {a(n)=polcoeff(sqrt((1/x)*serreverse( x*(1-x-x^2)^2/(1+x +x*O(x^n))^2)), n)}

%o for(n=0,31,print1(a(n),", "))

%o (PARI) {a(n)=local(A=1+x+x*O(x^n)); for(i=1, n, A=exp(sum(m=1, n, sum(j=0, m, binomial(m, j)^2*A^j)*x^m*A^m/m))); polcoeff(A, n)}

%o (PARI) {a(n)=local(A=1+x+x*O(x^n)); for(i=1, n, A=exp(sum(m=1, n, sum(j=0, m, binomial(m, j)^2/A^j)*x^m*A^(2*m)/m))); polcoeff(A, n)}

%o (PARI) {a(n)=polcoeff(((1+x)/(1-x-x^2 +x*O(x^n)))^(2*n+1)/(2*n+1),n)}

%o (Maxima)

%o a(n):=sum(binomial(2*n+i,i)*binomial(2*n+i+1,n-i),i,0,n)/(2*n+1); /* _Vladimir Kruchinin_, Apr 04 2019 */

%Y Cf. A007863, A198953, A215624, A198951.

%Y Column k=3 of A245049.

%K nonn

%O 0,2

%A _Paul D. Hanna_, Aug 19 2012

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 July 13 21:44 EDT 2024. Contains 374288 sequences. (Running on oeis4.)