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!)
A268555 Diagonal of the rational function of six variables 1/((1 - w - u v - u v w) * (1 - z - x y)). 74

%I #66 Mar 25 2023 08:18:52

%S 1,6,78,1260,22470,424116,8305836,166929048,3419932230,71109813060,

%T 1496053026468,31777397077608,680354749147164,14664155597771400,

%U 317877850826299800,6924815555276838960,151505459922479997510,3327336781596164286180

%N Diagonal of the rational function of six variables 1/((1 - w - u v - u v w) * (1 - z - x y)).

%C Also diagonal of rational function R(x,y,z) = 1 /(1 - x - y - z - x*y + x*z).

%C Annihilating differential operator: x*(16*x^2-24*x+1)*(d/dx)^2 + (48*x^2-48*x+1)*(d/dx) + 12*x-6.

%H Vaclav Kotesovec, <a href="/A268555/b268555.txt">Table of n, a(n) for n = 0..200</a>

%H A. Bostan, S. Boukraa, J.-M. Maillard, J.-A. Weil, <a href="http://arxiv.org/abs/1507.03227">Diagonals of rational functions and selected differential Galois groups</a>, arXiv preprint arXiv:1507.03227 [math-ph], 2015.

%H Jacques-Arthur Weil, <a href="http://www.unilim.fr/pages_perso/jacques-arthur.weil/diagonals/">Supplementary Material for the Paper "Diagonals of rational functions and selected differential Galois groups"</a>

%F D-finite with recurrence: n^2*a(n) -6*(2*n-1)^2*a(n-1) +4*(2*n-1)*(2*n-3)*a(n-2)=0. - _R. J. Mathar_, Mar 10 2016

%F a(n) ~ sqrt(4+3*sqrt(2)) * 2^(2*n-3/2) * (1+sqrt(2))^(2*n) / (Pi*n). - _Vaclav Kotesovec_, Jul 01 2016

%F G.f.: hypergeom([1/12, 5/12],[1],6912*x^4*(1-24*x+16*x^2)/(1-24*x+48*x^2)^3)/(1-24*x+48*x^2)^(1/4).

%F 0 = x*(16*x^2-24*x+1)*y'' + (48*x^2-48*x+1)*y' + (12*x-6)*y, where y is g.f.

%F a(n) = A000984(n)*A001850(n) = C(2*n,n)*Sum_{k = 0..n} C(n,k)*C(n+k,k). - _Peter Bala_, Mar 19 2018

%e G.f. = 1 + 6*x + 78*x^2 + 1260*x^3 + 22470*x^4 + 424116*x^5 + 8305836*x^6 + ...

%p A268555 := proc(n)

%p 1/(1-w-u*v-u*v*w)/(1-z-x*y) ;

%p coeftayl(%,x=0,n) ;

%p coeftayl(%,y=0,n) ;

%p coeftayl(%,z=0,n) ;

%p coeftayl(%,u=0,n) ;

%p coeftayl(%,v=0,n) ;

%p coeftayl(%,w=0,n) ;

%p end proc:

%p seq(A268555(n),n=0..40) ; # _R. J. Mathar_, Mar 10 2016

%p seq(binomial(2*n,n)*add(binomial(n,k)*binomial(n+k,k), k = 0..n), n = 0..20); # _Peter Bala_, Mar 19 2018

%t sc = SeriesCoefficient;

%t a[n_] := 1/(1-w-u*v-u*v*w)/(1-z-x*y) // sc[#, {x, 0, n}]& // sc[#, {y, 0, n}]& // sc[#, {z, 0, n}]& // sc[#, {u, 0, n}]& // sc[#, {v, 0, n}]& // sc[#, {w, 0, n}]&;

%t Table[a[n], {n, 0, 40}] (* _Jean-François Alcover_, Nov 14 2017 *)

%t a[n_] := Product[Hypergeometric2F1[-n, -n, 1, i], {i, 1, 2}];

%t Table[a[n], {n, 0, 17}] (* _Peter Luschny_, Mar 19 2018 *)

%o (PARI) \\ system("wget http://www.jjj.de/pari/hypergeom.gpi");

%o read("hypergeom.gpi");

%o N = 18; x = 'x + O('x^N);

%o Vec(hypergeom_sym([1/12, 5/12],[1],6912*x^4*(1-24*x+16*x^2)/(1-24*x+48*x^2)^3, N)/(1-24*x+48*x^2)^(1/4)) \\ _Gheorghe Coserea_, Jul 05 2016

%o (PARI) {a(n) = if( n<1, n==0, my(A = vector(n+1)); A[1] = 1; A[2] = 6; for(k=2, n, A[k+1] = (6*(2*k-1)^2*A[k] - 4*(2*k-1)*(2*k-3)*A[k-1]) / k^2); A[n+1])}; /* _Michael Somos_, Jan 22 2017 */

%o (PARI)

%o diag(expr, N=22, var=variables(expr)) = {

%o my(a = vector(N));

%o for (k = 1, #var, expr = taylor(expr, var[#var - k + 1], N));

%o for (n = 1, N, a[n] = expr;

%o for (k = 1, #var, a[n] = polcoeff(a[n], n-1)));

%o return(a);

%o };

%o diag(1/(1 - x - y - z - x*y + x*z), 18)

%o \\ test: diag(1/(1-x-y-z-x*y+x*z)) == diag(1/((1-w-u*v-u*v*w)*(1-z-x*y)))

%o \\ _Gheorghe Coserea_, Jun 15 2018

%o (GAP) List([0..20],n->Binomial(2*n,n)*Sum([0..n],k->Binomial(n,k)*Binomial(n+k,k))); # _Muniru A Asiru_, Mar 19 2018

%Y Cf. A268545-A268555. Cf. A000984, A001850.

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_, Feb 29 2016

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 April 24 16:25 EDT 2024. Contains 371961 sequences. (Running on oeis4.)