A002894 -id:A002894 - cp's OEIS frontend

A245086 Central values of the n-th discrete Chebyshev polynomials of order 2n.

1, 0, -6, 0, 90, 0, -1680, 0, 34650, 0, -756756, 0, 17153136, 0, -399072960, 0, 9465511770, 0, -227873431500, 0, 5550996791340, 0, -136526995463040, 0, 3384731762521200, 0, -84478098072866400, 0, 2120572665910728000, 0, -53494979785374631680, 0

Offset: 0

Nikita Gogin, Jul 11 2014

In the general case the n-th discrete Chebyshev polynomial of order N is D(N,n;x) = Sum_{i = 0..n} (-1)^i*C(n,i)*C(N-x,n-i)*C(x,i). For N = 2*n , x = n, one gets a(n) = D(2n,n;n) = Sum_{i = 0..n} (-1)^i*C(n,i)^3 that equals (due to Dixon's formula) 0 for odd n and (-1)^m*(3m)!/(m!)^3 for n = 2*m. (Riordan, 1968) So, a(2*m) = (-1)^m*A006480(m).

John Riordan, Combinatorial Identities, John Willey&Sons Inc., 1968.

Nikita Gogin and Mika Hirvensalo, On the Generating Function of Discrete Chebyshev Polynomials, TUCS Technical Reports 819, Turku Centre for Computer Science, 2007.
Nikita Gogin and Mika Hirvensalo, Recurrent Constructions of the MacWilliams and Chebyshev Matrices, Fundamenta Informaticae, vol.116, issue 1-4, January 2012, pages 93-110.
H. W. Gould, Tables of Combinatorial Identities, Edited by J. Quaintance.
Darij Grinberg, Introduction to Modern Algebra (UMN Spring 2019 Math 4281 Notes), University of Minnesota (2019).
Y. Sun and X. Wang, A new proof of a curious identity, Math Gazette, Vol. 91, No. 520 (Mar 2007) 105-107.
Wikipedia, Dixon's identity

Cf. A000172, A002894, A005260, A006480, A103882, A183204, A273630, A364303.

Table[Coefficient[Simplify[JacobiP[n,0,-(2*n+1),(1+t^2)/(1-t^2)]*(1-t^2)^n],t,n],{n,0,20}]

from math import factorial
def A245086(n): return 0 if n&1 else (-1 if (m:=n>>1)&1 else 1)*factorial(3*m)//factorial(m)**3 # Chai Wah Wu, Oct 04 2022

a(n) is a coefficient at t^n in (1-t^2)^n*P(0,-(2*n+1);n;(1+t^2)/(1-t^2)), where P(a,b;k;x) is the k-th Jacobi polynomial (Gogin and Hirvensalo, 2007).
G.f.: Hypergeometric2F1[1/3,2/3,1,-27*x^2].
a(2*m+1) = 0, a(2*m) = (-1)^m*A006480(m).
From Peter Bala, Aug 04 2016: (Start)
a(n) = Sum_{k = 0..n} (-1)^k*binomial(n,k)*binomial(2*n - k,n)*binomial(n + k,n) (Sun and Wang).
a(n) = Sum_{k = 0..n} (-1)^(n + k)*binomial(n + k, n - k)*binomial(2*k, k)*binomial(2*n - k, n) (Gould, Vol.5, 9.23).
a(n) = -1/(n + 1)^3 * A273630(n+1). (End)
From Peter Bala, Mar 22 2022: (Start)
a(n) = - (3*(3*n-2)*(3*n-4)/n^2)*a(n-2).
a(n) = [x^n] (1 - x)^(2*n) * P(n,(1 + x)/(1 - x)), where P(n,x) denotes the n-th Legendre polynomial. Compare with A002894(n) = binomial(2*n,n)^2 = [x^n] (1 - x)^(2*n) * P(2*n,(1 + x)/(1 - x)). Cf. A103882. (End)
From Peter Bala, Jul 23 2023: (Start)
a(n) = [x^n] G(x)^(3*n), where the power series G(x) = 1 - x^2 + 2*x^4 - 14*x^6 + 127*x^8 - 1364*x^10 + ... appears to have integer coefficients.
exp(Sum_{n >= 1} a(n)*x^n/n) = F(x)^3, where the power series F(x) = 1 - x^2  + 8*x^4 - 101*x^6 + 1569*x^8 - 27445*x^10 + ..., appears to have integer coefficients. See A229452.
Row 1 of A364303. (End)
a(n) = Sum_{k = 0..n} (-1)^(n-k) * binomial(n+k, k)^2 * binomial(3*n+1, n-k). Cf. A183204.- Peter Bala, Sep 20 2024

A000515 a(n) = (2n)!(2n+1)!/n!^4, or equally (2n+1)*binomial(2n,n)^2.

Original entry on oeis.org

1, 12, 180, 2800, 44100, 698544, 11099088, 176679360, 2815827300, 44914183600, 716830370256, 11445589052352, 182811491808400, 2920656969720000, 46670906271240000, 745904795339462400, 11922821963004219300, 190600129650794094000, 3047248986392325330000

Offset: 0

N. J. A. Sloane

a(n) is also the (n,n)-th entry in the inverse of the n-th Hilbert matrix. - Asher Auel, May 20 2001
a(n) is also the ratio of the determinants of the n-th Hilbert matrix to the (n+1)-th Hilbert matrix (see A005249), for n>0. Thus the determinant of the inverse of the n-th Hilbert matrix is the product of a(i) for i from 1 to n. (Claimed by Jud McCranie without proof, Jul 17 2000)
a(n) is the right side of the binomial sum: 2^(4*n) * Sum_{i=0..n} binomial(-1/2, i)*binomial(1/2, i). - Yong Kong (ykong(AT)curagen.com), Dec 26 2000
Right-hand side of Sum_{i=0..n} Sum_{j=0..n} binomial(i+j,j)^2 * binomial(4n-2i-2j,2n-2j).

E. R. Hansen, A Table of Series and Products, Prentice-Hall, Englewood Cliffs, NJ, 1975, p. 96.
A. P. Prudnikov, Yu. A. Brychkov and O. I. Marichev, "Integrals and Series", Volume 1: "Elementary Functions", Chapter 4: "Finite Sums", New York, Gordon and Breach Science Publishers, 1986-1992.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

T. D. Noe, Table of n, a(n) for n = 0..100
G. E. Andrews and P. Paule, Some questions concerning computer-generated proofs of a binomial double-sum identity, J. Symbolic Computation 11(1994), 1-7.
D. Galakhov, A. Mironov and A. Morozov, Wall Crossing Invariants: from quantum mechanics to knots, arXiv preprint arXiv:1410.8482 [hep-th], 2014. See Eq. (A.15).
R. K. Guy, Letter to N. J. A. Sloane, Sep 1986
J. E. Lauer, Letter to N. J. A. Sloane, Dec 1980
D. H. Lehmer, Review of A. N. Lowan et al., "Table of the zeros of the Legendre polynomials of order 1-16...", in Math. Tables Aids Computation (MTAC), 1 (1943-1945), 52-53.
Pedro J. Miana and Natalia Romero, Moments of combinatorial and Catalan numbers, Journal of Number Theory, Volume 130, Issue 8, August 2010, Pages 1876-1887. See Omega3. Remark 3 p. 1882.
I. Nemes et al., How to do Monthly problems with your computer, Amer. Math. Monthly, 104 (1997), 505-519.
Yidong Sun and Fei Ma, Four transformations on the Catalan triangle, arXiv preprint arXiv:1305.2017 [math.CO], 2013 (see Omega_3).
Yidong Sun and Fei Ma, Some new binomial sums related to the Catalan triangle, Electronic Journal of Combinatorics 21(1) (2014), #P1.33

Cf. A002894, A005249, A002457, A000108, A039598, A024492, A000894, A228329, A000515, A228330, A228331, A228332, A228333.

[(2*n+1)*Binomial(2*n,n)^2: n in [0..25]]; // Vincenzo Librandi, Oct 08 2015

with(linalg): for n from 1 to 24 do print(det(hilbert(n))/det(hilbert(n+1))): od;

A000515[n_] := (2*n + 1)*Binomial[2 n, n]^2 (* Enrique Pérez Herrero, Mar 31 2010 *)
Table[(2 n + 1) (n + 1)^2 CatalanNumber[n]^2, {n, 0, 18}] (* Jan Mangaldan, Sep 23 2021 *)

vector(100, n, n--; (2*n+1)*binomial(2*n,n)^2) \\ Altug Alkan, Oct 08 2015

a(n) ~ 2*Pi^-1*2^(4*n). - Joe Keane (jgk(AT)jgk.org), Jun 07 2002
O.g.f.: (2/Pi)*EllipticE(4*sqrt(x))/(1-16*x). - Vladeta Jovovic, Jun 15 2005
E.g.f.: Sum_{n>=0} a(n)*x^(2n)/(2n)! = BesselI(0, 2*x)*(BesselI(0, 2*x) + 4*x*BesselI(1, 2*x)). - Vladeta Jovovic, Jun 15 2005
E.g.f.: Sum_{n>=0} a(n)*x^(2n+1)/(2n+1)! = BesselI(0, 2x)^2*x. - Michael Somos, Jun 22 2005
E.g.f.: x*(BesselI(0, 2*x))^2 = x+(2*x^3)/(U(0)-2*x^2); U(k) = (2*x^2)*(2*k+1) + (k+1)^3 - (2*x^2)*(2*k+3)*((k+1)^3)/U(k+1); (continued fraction). - Sergei N. Gladkovskii, Nov 23 2011
n^2*a(n) - 4*(2*n-1)*(2*n+1)*a(n-1) = 0. - R. J. Mathar, Sep 08 2013
O.g.f.: hypergeom([1/2, 3/2], [1], 16*x). - Peter Luschny, Oct 08 2015

A018224 a(n) = binomial(n, floor(n/2))^2 = A001405(n)^2.

Original entry on oeis.org

1, 1, 4, 9, 36, 100, 400, 1225, 4900, 15876, 63504, 213444, 853776, 2944656, 11778624, 41409225, 165636900, 590976100, 2363904400, 8533694884, 34134779536, 124408576656, 497634306624, 1828114918084, 7312459672336, 27043120090000, 108172480360000, 402335398890000

Offset: 0

N. J. A. Sloane

a(n) is also the number of rooted two-vertex (or, dually, two-face) regular planar maps of valency n+1. - Valery A. Liskovets, Oct 19 2005
If A is a random matrix in USp(4) (4 X 4 complex matrices that are unitary and symplectic), then a(n)=(-1)^n*E[(tr(A^4))^n]. - Andrew V. Sutherland, Apr 01 2008
Number of square lattice walks with unit steps in all four directions (NSWE), starting at the origin, ending on the y-axis, and never going below the x-axis. Row sums of A378061. - Peter Luschny, Dec 08 2024

			The 9 lattice walks defined in the comments: 'NNN', 'NNS', 'NSN', 'NWE', 'NEW', 'WNE', 'WEN', 'ENW', 'EWN'.

Stephanie Anderson, Table for n, a(n) for n = 0..200
Alin Bostan, Computer Algebra for Lattice Path Combinatorics, Slides, Séminaire de Combinatoire Ph. Flajolet, March 28 2013.
Alin Bostan, Computer Algebra for Lattice Path Combinatorics, Synthesis, Séminaire de Combinatoire Ph. Flajolet, June 06 2013.
Alin Bostan, Calcul Formel pour la Combinatoire des Marches [The text is in English], Habilitation à Diriger des Recherches, Laboratoire d'Informatique de Paris Nord, Université Paris 13, December 2017.
Alin Bostan, Frédéric Chyzak, Mark van Hoeij, Manuel Kauers, and Lucien Pech, Hypergeometric expressions for generating functions of walks with small steps in the quarter plane, Eur. J. Comb. 61, 242-275 (2017).
M. Bousquet, G. Labelle and P. Leroux, Enumeration of planar two-face maps, Discrete Math., vol. 222 (2000), 1-25.
Kiran S. Kedlaya and Andrew V. Sutherland, Hyperelliptic curves, L-polynomials and random matrices, arXiv:0803.4462 [math.NT], 2008-2010.
Helmut Prodinger, Two New Identities Involving the Catalan Numbers: A classical approach, arXiv:1911.07604 [math.CO], 2019.

Bisections are A002894 and A060150.

Cf. A000108, A001405, A056040, A113182, A138545, A378061.

s := x -> (1+x)*EllipticK(x)/(x*Pi/2)-1/x:
seq(4^n*coeff(series(s(x),x,n+2),x,n),n=0..23); # Peter Luschny, Oct 14 2015

(* Note that Mathematica uses a different definition of the EllipticK function. *)
CoefficientList[Series[(-Pi + (2 + 8 x) EllipticK[16 x^2])/(4 Pi x), {x,0,23}], x] (* Peter Luschny, Oct 14 2015 *)
Table[Binomial[n,Floor[n/2]]^2,{n,0,30}] (* Harvey P. Dale, Dec 02 2022 *)

vector(50, n, n--; binomial(n, n\2)^2) \\ Altug Alkan, Oct 14 2015

E.g.f.: BesselI(0, 2*x)*(BesselI(0, 2*x)+BesselI(1, 2*x)). - Vladeta Jovovic, Jun 12 2005
G.f. (1+1/(4*x))*hypergeom([1/2, 1/2],[1],16*x^2)-1/(4*x). - Mark van Hoeij, Oct 13 2009
a(n) = (n!/(floor(n/2)!*floor((n+1)/2)!))^2. - Peter Luschny, Apr 29 2014
a(n) = A056040(n) * A056040(n+1) / (n+1). - Peter Luschny, Apr 29 2014
a(n) = 4^n*[x^n]((1+x)*EllipticK(x)/(x*Pi/2)-1/x). - Peter Luschny, Oct 14 2015
a(n) ~ 4^n*((2*n+3)/(2*n+1))^((-1)^n/2)/((n+1)*Pi/2). - Peter Luschny, Oct 14 2015
a(n) = Sum_{k=0..n} (-1)^k*binomial(n,k)*C(k)*binomial(2*n-2*k,n-k) where C(k) are Catalan numbers (A000108), see Prodinger. - Michel Marcus, Nov 19 2019
From Peter Bala, Jul 03 2023: (Start)
Right hand side of the binomial sum identity (1/2)*Sum_{k = 0..n+1} (-1)^k*4^(n+1-k)*binomial(n+1,k)*binomial(n+k,k)*binomial(2*k,k) = a(n).
a(n) = (1/2)*4^(n+1) * hypergeom([n+1, -n-1, 1/2], [1, 1], 1).
P-recursive:
(2*n - 1)*(n + 1)^2*a(n) = 4*(2*n^2 - 1)*a(n-1) + 16*(2*n + 1)*(n - 1)^2*a(n-2) with a(0) = a(1) = 1. (End)

A039699 Number of 4-dimensional cubic lattice walks that start and end at the origin after 2n steps, free to pass through origin at intermediate stages.

Original entry on oeis.org

1, 8, 168, 5120, 190120, 7939008, 357713664, 16993726464, 839358285480, 42714450658880, 2225741588095168, 118227198981126144, 6380762273973278464, 349019710593278412800, 19310744204362333900800, 1079054103459778710405120, 60818479243449308702049960

Offset: 0

Alessandro Zinani (alzinani(AT)tin.it)

Generating function G(x) is D-finite with a singular point at x = 1/64 (cf. Graph Link). After summing 300000 terms, G(1/64) = 1.239466... and 1 - 1/G(1/64) = 0.193201... Convergence to A086232 is very slow. - Bradley Klee, Aug 20 2018

a(n) is also the constant term in the expansion of (w + 1/w + x + 1/x + y + 1/y + z + 1/z)^(2n). This follows directly from the sequence name, each variable corresponding to a single step in one of the four axis directions. - Christopher J. Smyth, Sep 28 2018

			a(5)=7939008, i.e., there are 7939008 different walks that start and end at origin of a 4-dimensional integer lattice after 2*5=10 steps, free to pass through origin at intermediate steps.

S. R. Finch, Mathematical Constants, Cambridge, 2003, pp. 322-331.

Seiichi Manyama, Table of n, a(n) for n = 0..557
S. R. Finch, Symmetric Random Walk on n-Dimensional Integer Lattice. [broken link]
Steven R. Finch, Symmetric Random Walk on n-Dimensional Integer Lattice. [Cached copy, with permission of the author]
S. Hassani, J.-M. Maillard, and N. Zenine, On the diagonals of rational functions: the minimal number of variables (unabridged version), arXiv:2502.05543 [math-ph], 2025. See pp. 33, 44.
Bradley Klee, Graph of g.f.
Gilbert Labelle and Annie Lacasse, Closed paths whose steps are roots of unity, in FPSAC 2011, Reykjavik, Iceland DMTCS proc. AO, 2011, 599-610.
Yen Lee Loh, A general method for calculating lattice Green functions on the branch cut, arXiv:1706.03083 [math-ph], 2017.
J. Novak, Pólya's random walk theorem, arXiv:1301.3916 [math.PR], 2013.

1-dimensional, 2-dimensional, 3-dimensional analogs are A000984, A002894, A002896. Pólya Constant: A086232.

Row k=4 of A287318.

A039699 := n -> binomial(2*n,n)^2*hypergeom([1/2, -n, -n, -n],[1, 1, 1/2 - n], 1):
seq(simplify(A039699(n)), n=0..14); # Peter Luschny, May 23 2017

max = 30 (* must be even *); Partition[ CoefficientList[ Series[ BesselI[0, 2 x]^4, {x, 0, max}], x]*Range[0, max]!, 2][[All, 1]] (* Jean-François Alcover, Oct 05 2011 *)
With[{nn=30},Take[CoefficientList[Series[BesselI[0,2x]^4,{x,0,nn}],x] Range[0,nn]!,{1,-1,2}]] (* Harvey P. Dale, Aug 09 2013 *)
RecurrenceTable[{256*(n-1)^2*(2*n-3)*(2*n-1)*a[n-2] - 4*(2*n-1)^2*(5*n^2-5*n+2)*a[n-1] + n^4*a[n]==0, a[0]==1, a[1]==8}, a, {n,0,100}] (* Bradley Klee, Aug 20 2018 *)

C=binomial;
A002895(n) = sum(k=0,n, C(n,k)^2 * C(2*n-2*k,n-k) * C(2*k,k) );
a(n)= C(2*n,n) * A002895(n);
/* Joerg Arndt, Apr 19 2013 */

from math import comb
def A039699(n): return comb(n<<1,n)*((sum(comb(n,k)**2*comb(n-k<<1,n-k)*comb(m:=k<<1,k) for k in range(n+1>>1))<<1) + (0 if n&1 else comb(n,n>>1)**4)) # Chai Wah Wu, Jun 17 2025

E.g.f.: Sum_{n>=0} a(2*n) * x^(2*n)/(2*n)! = I_0(2*x)^4. (I = Modified Bessel function of the first kind).
a(n) = binomial(2*n,n)*A002895(n). - Mark van Hoeij, Apr 19 2013
a(n) = binomial(2*n,n)^2*hypergeom([1/2,-n,-n,-n],[1,1,1/2-n],1). - Peter Luschny, May 23 2017
a(n) ~ 2^(6*n+1) / (Pi*n)^2. - Vaclav Kotesovec, Nov 13 2017
From Bradley Klee, Aug 20 2018: (Start)
G.f.: Define G(x) = Sum_{n>=0} a(n)*x^n and G^(j) = (d/dx)^j G(x), then Sum_{j=0..4,k=0..5} M_{j,k}*G^(j)*x^k = 0, with
M={{-8, 768, 0, 0, 0, 0}, {1, -424, 14592, 0, 0, 0}, {0, 7, -1172, 25344, 0, 0}, {0, 0, 6, -640, 10240, 0}, {0, 0, 0, 1, -80, 1024}}.
Sum_{j=0..2,k=0..4} M_{j,k}*a(n-j)*n^k = 0, with
M={{0, 0, 0, 0, 1}, {-8, 52, -132, 160, -80}, {768, -3584, 5888, -4096, 1024}}.
(End)
a(n) = Sum_{i+j+k+l=n, 0<=i,j,k,l<=n} multinomial(2n [i,i,j,j,k,k,l,l]). - Shel Kaphan, Jan 16 2023

A186420 a(n) = binomial(2n,n)^4.

Original entry on oeis.org

1, 16, 1296, 160000, 24010000, 4032758016, 728933458176, 138735983333376, 27435582641610000, 5588044012339360000, 1165183173971324375296, 247639903129149250277376, 53472066459540320483696896, 11701285507234585729600000000, 2589980371199606611713600000000

Offset: 0

Emanuele Munarini, Feb 21 2011

			G.f.: 4F3({1/2,1/2,1/2,1/2},{1,1,1},256x) where 4F3 is a hypergeometric series.

Seiichi Manyama, Table of n, a(n) for n = 0..417

Cf. binomial(2n,n)^k: A000984 (k=1), A002894 (k=2), A002897 (k=3), this sequence (k=4).

Cf. A000108, A000888, A186414, A186415, A186416, A186418, A186419, A000897, A006480, A008977, A188662.

Table[Binomial[2n,n]^4,{n,0,20}]
Table[Coefficient[Series[HypergeometricPFQ[{1/2, 1/2, 1/2, 1/2}, {1, 1, 1}, 256 x], {x, 0, n}], x, n], {n, 0, 14}] (* Michael De Vlieger, Jul 13 2016 *)

Maxima
```
makelist(binomial(2*n,n)^4,n,0,40);
```

a(n) = A000984(n)^4 = A002894(n)^2.
a(n) = binomial(2*n,n)^4 = ( [x^n](1 + x)^(2*n) )^4 = [x^n](F(x)^(16*n)), where F(x) = 1 + x + 25*x^2 + 1798*x^3 + 183442*x^4 + 22623769*x^5 + 3142959012*x^6 + ... appears to have integer coefficients. For similar results see A000897, A002894, A002897, A006480, A008977 and A188662. - Peter Bala, Jul 14 2016
a(n) ~ 256^n/(Pi*n)^2. - Ilya Gutkovskiy, Jul 13 2016

A232606 G.f. A(x) satisfies: the sum of the coefficients of x^k, k=0..n, in A(x)^n equals (2*n)!^2/n!^4, the square of the central binomial coefficients (A000984), for n>=0.

Original entry on oeis.org

1, 3, 10, 42, 221, 1379, 9678, 73666, 594326, 5007958, 43641702, 390632678, 3573598539, 33289289533, 314871186248, 3017358158132, 29242725947318, 286209134234602, 2825613061237808, 28111283170770480, 281598654896870051, 2838309465080014489, 28767973963085929656, 293059625830028920012

Offset: 0

Paul D. Hanna, Nov 26 2013

nonn

Compare to: Sum_{k=0..n} [x^k] 1/(1-x)^n = (2*n)!/n!^2 = A000984(n).

a(n+1)/a(n) tends to 11.3035... - Vaclav Kotesovec, Jan 23 2014

			G.f.: A(x) = 1 + 3*x + 10*x^2 + 42*x^3 + 221*x^4 + 1379*x^5 + 9678*x^6 +...
ILLUSTRATION OF INITIAL TERMS.
If we form an array of coefficients of x^k in A(x)^n, n>=0, like so:
A^0: [1], 0,   0,    0,     0,      0,       0,        0,         0, ...;
A^1: [1,  3], 10,   42,   221,   1379,    9678,    73666,    594326, ...;
A^2: [1,  6,  29], 144,   794,   4924,   33814,   251544,   1988885, ...;
A^3: [1,  9,  57,  333], 1989,  12669,   86935,   639123,   4979499, ...;
A^4: [1, 12,  94,  636,  4157], 27728,  193504,  1423120,  11006058, ...;
A^5: [1, 15, 140, 1080,  7730,  54538], 391970,  2915490,  22558825, ...;
A^6: [1, 18, 195, 1692, 13221,  99102,  739547], 5612016,  43767477, ...;
A^7: [1, 21, 259, 2499, 21224, 169232, 1317722, 10267666], 81223912, ...;
A^8: [1, 24, 332, 3528, 32414, 274792, 2238492, 17990904, 145096413], ...; ...
then the sum of the coefficients of x^k, k=0..n, in A(x)^n (shown above in brackets) equals the square of the central binomial coefficients:
1^1 = 1;
2^2 = 1 + 3;
6^2 = 1 +  6 +  29;
20^2 = 1 +  9 +  57 +  333;
70^2 = 1 + 12 +  94 +  636 +  4157;
252^2 = 1 + 15 + 140 + 1080 +  7730 +  54538;
924^2 = 1 + 18 + 195 + 1692 + 13221 +  99102 +  739547;
3432^2 = 1 + 21 + 259 + 2499 + 21224 + 169232 + 1317722 + 10267666; ...
RELATED SERIES.
From a main diagonal in the above array we can derive sequence A232607:
[1/1, 6/2, 57/3, 636/4, 7730/5, 99102/6, 1317722/7, 17990904/8, ...] =
[1, 3, 19, 159, 1546, 16517, 188246, 2248863, 27844369, 354576634, ...];
from which we can form the series G(x) = A(x*G(x)):
G(x) = 1 + 3*x + 19*x^2 + 159*x^3 + 1546*x^4 + 16517*x^5 + 188246*x^6 +...
such that
(G(x) + x*G'(x)) / (G(x) - x*G(x)^2) = 1 + 2^2*x + 6^2*x^2 + 20^2*x^3 + 70^2*x^4 + 252^2*x^5 +...+ A000984(n)^2*x^n +...

Vaclav Kotesovec, Table of n, a(n) for n = 0..350

Cf. A232683, A232607, A232687, A000984, A002894.

terms = 24; a[0] = 1; A[x_] = Sum[a[n]*x^n, {n, 0, terms - 1}];
c[n_] := Sum[Coefficient[B[x], x, k], {k, 0, n}] == (2*n)!^2/n!^4 // Solve // First;
Do[B[x_] = A[x]^n + O[x]^(n+1) // Normal; A[x_] = (A[x] /. c[n]) + O[x]^terms, {n, 0, terms-1}];
CoefficientList[A[x], x] (* Jean-François Alcover, Jan 14 2018 *)

/* By Definition: */
{a(n)=if(n==0, 1, ((2*n)!^2/n!^4 - sum(k=0, n, polcoeff(sum(j=0, min(k, n-1), a(j)*x^j)^n + x*O(x^k), k)))/n)}
for(n=0,20,print1(a(n)*1!,", "))

/* Faster, using series reversion: */
{a(n)=local(CB2=sum(k=0,n,binomial(2*k,k)^2*x^k)+x*O(x^n), G=1+x*O(x^n));
for(i=1,n,G = 1 + intformal( (CB2-1)*G/x - CB2*G^2));polcoeff(x/serreverse(x*G),n)}
for(n=0,30,print1(a(n),", "))

Given g.f. A(x), Sum_{k=0..n} [x^k] A(x)^n = (2*n)!^2/n!^4 = A000984(n)^2.

Given g.f. A(x), let G(x) = A(x*G(x)) then (G(x) + x*G'(x)) / (G(x) - x*G(x)^2) = Sum_{n>=0} (2*n)!^2/n!^4 * x^n.

A229644 Cogrowth function of the group Baumslag-Solitar(2,2).

Original entry on oeis.org

1, 4, 28, 244, 2396, 25324, 281140, 3232352, 38151196, 459594316, 5628197948, 69859456440, 876985904276, 11115789165888, 142066687799680, 1828884017527504, 23694360858872604, 308714491495346028, 4042605442981407388, 53178663502737007352

Offset: 0

Murray Elder, Sep 27 2013

a(n) is the number of words of length 2n in the letters a,a^{-1},t,t^{-1} that equal the identity of the group BS(2,2)=.

			For n=1 there are 4 words of length 2 equal to the identity: aa^{-1}, a^{-1}a, tt^{-1}, t^{-1}t.

Murray Elder, Table of n, a(n) for n = 0..50
M. Elder, A. Rechnitzer, E. J. Janse van Rensburg, T. Wong, The cogrowth series for BS(N,N) is D-finite
Wikipedia, Baumslag-Solitar group
Index entries for sequences related to groups

The cogrowth sequences for BS(N,N) for N = 1..10 are A002894, A229644, A229645, A229646, A229647, A229648, A229649, A229650, A229651, A229652.

A229645 Cogrowth function of the group Baumslag-Solitar(3,3).

Original entry on oeis.org

1, 4, 28, 232, 2108, 20364, 205696, 2149956, 23087260, 253400200, 2831688428, 32121034928, 368996930720, 4284878088040, 50221403053556, 593400572917032, 7061298334083484, 84555438345880932, 1018170456984477856, 12321676227943830972

Offset: 0

Murray Elder, Sep 27 2013

a(n) is the number of words of length 2n in the letters a,a^{-1},t,t^{-1} that equal the identity of the group BS(3,3)=.

			For n=1 there are 4 words of length 2 equal to the identity: aa^{-1}, a^{-1}a, tt^{-1}, t^{-1}t.

Murray Elder, Table of n, a(n) for n = 0..49
M. Elder, A. Rechnitzer, E. J. Janse van Rensburg, T. Wong, The cogrowth series for BS(N,N) is D-finite
Index entries for sequences related to groups

The cogrowth sequences for BS(N,N) for N = 1..10 are A002894, A229644, A229645, A229646, A229647, A229648, A229649, A229650, A229651, A229652.

A229646 Cogrowth function of the group Baumslag-Solitar(4,4).

Original entry on oeis.org

1, 4, 28, 232, 2092, 19884, 196096, 1988424, 20611116, 217526524, 2330681348, 25296553088, 277653104800, 3077568629256, 34410056828392, 387725845018512, 4399241841920428, 50228061806093020, 576729989899675348

Offset: 0

Murray Elder, Sep 27 2013

a(n) is the number of words of length 2n in the letters a,a^{-1},t,t^{-1} that equal the identity of the group BS(4,4)=.

			For n=1 there are 4 words of length 2 equal to the identity: aa^{-1}, a^{-1}a, tt^{-1}, t^{-1}t.

Murray Elder, Table of n, a(n) for n = 0..50
M. Elder, A. Rechnitzer, E. J. Janse van Rensburg, T. Wong, The cogrowth series for BS(N,N) is D-finite
Index entries for sequences related to groups

The cogrowth sequences for BS(N,N) for N = 1..10 are A002894, A229644, A229645, A229646, A229647, A229648, A229649, A229650, A229651, A229652.

A229647 Cogrowth function of the group Baumslag-Solitar(5,5).

Original entry on oeis.org

1, 4, 28, 232, 2092, 19864, 195376, 1971932, 20303084, 212400232, 2251379688, 24129199208, 261067326544, 2848016992032, 31295785633532, 346126420439512, 3850363854970476, 43057199315715676, 483795646775017312, 5459770924922887392

Offset: 0

Murray Elder, Sep 27 2013

a(n) is the number of words of length 2n in the letters a,a^{-1},t,t^{-1} that equal the identity of the group BS(5,5)=.

			For n=1 there are 4 words of length 2 equal to the identity: aa^{-1}, a^{-1}a, tt^{-1}, t^{-1}t.

Murray Elder, Table of n, a(n) for n = 0..50
M. Elder, A. Rechnitzer, E. J. Janse van Rensburg, T. Wong, The cogrowth series for BS(N,N) is D-finite
Index entries for sequences related to groups

The cogrowth sequences for BS(N,N) for N = 1..10 are A002894, A229644, A229645, A229646, A229647, A229648, A229649, A229650, A229651, A229652.

cp's OEIS Frontend

A245086 Central values of the n-th discrete Chebyshev polynomials of order 2n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

Python

Formula

A000515 a(n) = (2n)!(2n+1)!/n!^4, or equally (2n+1)*binomial(2n,n)^2.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A018224 a(n) = binomial(n, floor(n/2))^2 = A001405(n)^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A039699 Number of 4-dimensional cubic lattice walks that start and end at the origin after 2n steps, free to pass through origin at intermediate stages.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

A186420 a(n) = binomial(2n,n)^4.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

Maxima

Formula

A232606 G.f. A(x) satisfies: the sum of the coefficients of x^k, k=0..n, in A(x)^n equals (2*n)!^2/n!^4, the square of the central binomial coefficients (A000984), for n>=0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A229644 Cogrowth function of the group Baumslag-Solitar(2,2).