A002894 -id:A002894 - cp's OEIS frontend

A275652 a(n) = binomial(3n,3n/2)binomial(2n,n)binomial(5n/2,n/2)/binomial(n,n/2).

1, 10, 300, 11440, 485100, 21841260, 1022041020, 49128552000, 2408829328620, 119918393838100, 6042249840712800, 307438844121252480, 15770112362658517500, 814459593645444166560, 42308586942403276440000, 2208850973597860123741440, 115825519836558228435979500

Offset: 0

Peter Bala, Aug 04 2016

Right-hand side of the binomial sum identity Sum_{k = 0..n} (-1)^(n+k)* binomial(3*n+k,3*n-k)*binomial(2*k,k)*binomial(2*n-k,n) = binomial(3*n,3*n/2)*binomial(2*n,n)*binomial(5*n/2,n/2)/binomial(n,n/2).
We also have Sum_{k = 0..3*n} (-1)^k*binomial(3*n+k,3*n-k)* binomial(2*k,k)*binomial(2*n-k,n) = binomial(3*n,3*n/2)*binomial(2*n,n)* binomial(5*n/2,n/2) /binomial(n,n/2).
Compare with Sum_{k = 0..n} (-1)^(n+k)*binomial(2*n+k,2*n-k)* binomial(2*k,k)*binomial(2*n-k,n) = binomial(2*n,n)^2 = A002894(n). See also A275653, A275654 and A275655.

Cf. A002894, A245086, A275653, A275654, A275655, A276098, A276100, A276101, A276102, A352651, A352652, A365025.

seq(simplify(factorial(3*n)*factorial(n/2)*factorial(5*n/2)/(factorial(n)^3*factorial(3*n/2)^2)), n = 0 .. 20);

Table[Binomial[3 n, 3 n/2] Binomial[2 n, n] Binomial[5 n/2, n/2] / Binomial[n, n/2], {n, 0, 16}] (* Michael De Vlieger, Aug 07 2016 *)

a(n) = sum(k = 0, n, binomial(2*n-k-1,n-k)*binomial(3*n,k)^2); \\ Michel Marcus, Apr 21 2022

from math import factorial
from sympy import factorial2
def A275652(n): return int(factorial(3*n)*factorial2(5*n)*factorial2(n)//factorial2(3*n)**2//factorial(n)**3) # Chai Wah Wu, Aug 08 2023

a(n) = (3*n)!*(5*n/2)!*(n/2)!/((3*n/2)!^2*n!^3).
Recurrence: a(n) = 5*(3*n - 1)*(3*n - 5)*(5*n - 2)*(5*n - 4)*(5*n - 6)*(5*n - 8)/(n^2*(n - 1)^2*(3*n - 2)*(3*n - 4)) * a(n-2).
a(n) = [x^n] G(x)^(5*n), where G(x) = 1 + 2*x + 12*x^2 + 184*x^3 + 3811*x^4 + 92796*x^5 + 2497358*x^6 + ... appears to have integer coefficients.
exp(Sum_{n >= 1} a(n)*x^n/n) = F(x)^5, where F(x) = 1 + 2*x + 32*x^2 + 824*x^3 + 26291*x^4 + 947506*x^5 + 36934522*x^6 + ... appears to have integer coefficients.
a(n) ~ sqrt(5/3)*5^(5*n/2)/(2*Pi*n). - Ilya Gutkovskiy, Aug 07 2016
From Peter Bala, Mar 22 2022: (Start)
For n >= 1, a(n) = (5/3)*binomial(m*n,2*n)*binomial(m*n/2,2*n)*binomial(2*n,n)^2/ binomial(m*n/2,n)^2 at m = -1. See A352651 for the case m = 1.
a(n) = Sum_{k = 0..n} binomial(2*n-k-1,n-k)*binomial(3*n,k)^2.
a(n) = [x^n] (1 - x)^(2*n) * P(3*n,(1 + x)/(1 - x)), where P(n,x) denotes the n-th Legendre polynomial. Cf. A245086.
a(p) == a(1) (mod p^3) for prime p >= 5.
Conjecture: the supercongruences a(n*p^k) == a(n*p^(k-1)) (mod p^(3*k)) hold for all primes p >= 5 and all positive integers n and k. (End)
Row 1 of A365025. - Peter Bala, Aug 18 2023

A053175 Catalan-Larcombe-French sequence.

Original entry on oeis.org

1, 8, 80, 896, 10816, 137728, 1823744, 24862720, 346498048, 4911669248, 70560071680, 1024576061440, 15008466534400, 221460239482880, 3287994183188480, 49074667327062016, 735814252604162048

Offset: 0

Peter J Larcombe, Nov 12 2001

These numbers were proposed as 'Catalan' numbers by an associate of Catalan. They appear as coefficients in the series expansion of an elliptic integral of the first kind. Defining f(x; c) = 1 /(1 - c^2*sin^2(x))^(1/2), consider the function I(c) obtained by integrating f(x; c) with respect to x between 0 and Pi/2. I(c) is transformed and written as a power series in c (through an intermediate variable) which acts as a generating function for the sequence.

Conjecture: Let P(n) be the (n+1) X (n+1) Hankel-type determinant with (i,j)-entry equal to a(i+j) for all i,j = 0,...,n. Then P(n)/2^(n*(n+3)) is a positive odd integer. - Zhi-Wei Sun, Aug 14 2013

			G.f. = 1 + 8*x + 80*x^2 + 896*x^3 + 10816*x^4 + 137728*x^5 + 1823774*x^6 + ...

P. J. Larcombe, D. R. French and E. J. Fennessey, The asymptotic behavior of the Catalan-Larcombe-French sequence {1, 8, 80, 896, 10816, ...}, Utilitas Mathematica, 60 (2001), 67-77.
P. J. Larcombe, D. R. French and C. A. Woodham, A note on the asymptotic behavior of a prime factor decomposition of the general Catalan-Larcombe-French number, Congressus Numerantium, 156 (2002), 17-25.

T. D. Noe, Table of n, a(n) for n=0..200
E. Catalan, Sur les Nombres de Segner, Rend. Circ. Mat. Pal., 1 (1887), 190-201. [From _Peter Luschny_, Jun 26 2009]
Lane Clark, An asymptotic expansion for the Catalan-Larcombe-French sequence, Journal of Integer Sequences, Vol. 7 (2004), Article 04.2.1.
A. F. Jarvis, P. J. Larcombe and D. R. French, Linear recurrences between two recent integer sequences, Congressus Numerantium, 169 (2004), 79-99.
A. F. Jarvis, P. J. Larcombe and D. R. French, Applications of the a.g.m. of Gauss: some new properties of the Catalan-Larcombe-French sequence, Congressus Numerantium, 161 (2003), 151-162.
A. F. Jarvis, P. J. Larcombe and D. R. French, Power series identities generated by two recent integer sequences, Bulletin ICA, 43 (2005), 85-95.
A. F. Jarvis, P. J. Larcombe and D. R. French, On Small Prime Divisibility of the Catalan-Larcombe-French sequence, Indian Journal of Mathematics, 47 (2005), 159-181.
A. F. Jarvis, P. J. Larcombe and D. R. French, A short proof of the 2-adic valuation of the Catalan-Larcombe-French number, Indian Journal of Mathematics, 48 (2006), 135-138.
F. Jarvis, H. A. Verrill, Supercongruences for the Catalan-Larcombe-French numbers, Ramanujan J (22) (2010) 171.
Xiao-Juan Ji, Zhi-Hong Sun, Congruences for Catalan-Larcombe-French numbers, arXiv:1505.00668 [math.NT], 2015 and JIS vol 19 (2016) # 16.3.4
P. J. Larcombe, A new asymptotic relation between two recent integer sequences, Congressus Numerantium, 175 (2005), 111-116.
Peter J. Larcombe, Daniel R. French, On the “Other” Catalan Numbers: A Historical Formulation Re-Examined, Congressus Numerantium, 143 (2000), 33-64.
P. J. Larcombe and D. R. French, On the integrality of the Catalan-Larcombe-French sequence {1, 8, 80, 896, 10816, ...}, Congressus Numerantium, 148 (2001), 65-91.
P. J. Larcombe and D. R. French, A new generating function for the Catalan-Larcombe-French sequence: proof of a result by Jovovic, Congressus Numerantium, 166 (2004), 161-172.
Guo-Shuai Mao, Proof of two supercongruences conjectured by Z.-W.Sun involving Catalan-Larcombe-French numbers, arXiv:1511.06222 [math.NT], 2015.
Brian Yi Sun, Baoyindureng Wu, Two-log-convexity of the Catalan-Larcombe-French sequence, arXiv:1602.04909 [math.CO], 2016. Also Journal of Inequalities and Applications, 2015, 2015:404; DOI: 10.1186/s13660-015-0920-0.
Zhi-Hong Sun, Congruences for Apéry-like numbers, arXiv:1803.10051 [math.NT], 2018.
N. M. Temme, Examples of 3_F_2-polynomials, Asymptotic Methods for Integrals, Chapter 13, pp. 167-179 (2014).
Yang Wen, On the Log-Concavity of the Root of the Catalan-Larcombe-French Numbers, American Journal of Mathematical and Computer Modelling, 2017; 2(4): 95-98.
E. X. W. Xia and O. X. M. Yao, A Criterion for the Log-Convexity of Combinatorial Sequences, The Electronic Journal of Combinatorics, 20 (2013), #P3.

Cf. A065409, A002894, A081085.

a := proc(n) option remember; if n = 0 then 1 elif n = 1 then 8 else (8*(3*n^2 -3*n+1)*a(n-1)-128*(n-1)^2*a(n-2))/n^2 fi end; # Peter Luschny, Jun 26 2009

a[ n_] := SeriesCoefficient[ EllipticK[ (8 x /(1 - 8 x))^2] / ((1 - 8 x) Pi/2), {x, 0, n}]; (* Michael Somos, Aug 01 2011 *)
a[ n_] := If[ n < 0, 0, n! SeriesCoefficient[ Exp[ 8 x] BesselI[ 0, 4 x]^2, {x, 0, n}]]; (* Michael Somos, Aug 01 2011 *)
Table[(-8)^n Sqrt[Pi] HypergeometricPFQRegularized[{1/2, -n, -n}, {1, 1/2 - n}, -1]/n!, {n, 0, 20}] (* Vladimir Reshetnikov, May 21 2016 *)

{a(n) = if( n<0, 0, polcoeff( 1 / agm( 1, 1 - 16*x + x * O(x^n)), n))}; /* Michael Somos, Feb 12 2003 */

{a(n) = if( n<0, 0, polcoeff( sum( k=0, n, binomial( 2*k ,k)^2 * (2*x - 16*x^2)^k, x * O(x^n)), n))}; /* Michael Somos, Mar 04 2003 */

G.f.: 1 / AGM(1, 1 - 16*x) = 2 * EllipticK(8*x / (1-8*x)) / ((1-8*x)*Pi), where AGM(x, y) is the arithmetic-geometric mean of Gauss and Legendre. Cf. A081085, A089602. - Michael Somos, Mar 04 2003 and Vladeta Jovovic, Dec 30 2003
E.g.f.: exp(8*x)*BesselI(0, 4*x)^2. - Vladeta Jovovic, Aug 20 2003
a(n)*n^2 = a(n-1)*8*(3*n^2 - 3*n + 1) - a(n-2)*128*(n-1)^2. - Michael Somos, Apr 01 2003
Exponential convolution of A059304 with itself: Sum(2^n*binomial(2*n, n)*x^n/n!, n=0..infinity)^2 = (BesselI(0, 4*x)*exp(4*x))^2 = hypergeom([1/2], [1], 8*x)^2. - Vladeta Jovovic, Sep 09 2003
a(n) ~ 2^(4n+1)/(Pi*n). - Vaclav Kotesovec, Oct 09 2012
a(n) = 2^n*Sum_{k=0..n} C(n,k)*C(2*k,k)*C(2(n-k),n-k), where C(n,k)=n!/(k!*(n-k)!). This formula has been proved via the Zeilberger algorithm (both sides of the equality satisfy the same recurrence relation). a(n)/2^n also has another expression: Sum_{k=0..floor(n/2)} C(n,2*k)*C(2*k,k)^2*4^(n-2*k). - Zhi-Wei Sun, Mar 21 2013
a(n) = (-1)^n*Sum_{k=0..n}C(2*k,k)*C(2(n-k),n-k)*C(k,n-k)*(-4)^k. I have proved this new formula via the Zeilberger algorithm. - Zhi-Wei Sun, Nov 19 2014

A357568 a(n) = 9binomial(2n,n)^2 - 8binomial(3n,n).

Original entry on oeis.org

1, 12, 204, 2928, 40140, 547512, 7535472, 105077376, 1484848332, 21237645000, 306972655704, 4477160465856, 65802123629424, 973487343836448, 14483651478207360, 216550246159148928, 3251660678391659724, 49011343741651501800, 741221951008966181160, 11243583961952559386400

Offset: 0

Peter Bala, Oct 21 2022

Conjectures:
1) a(p^r) == a(p^(r-1)) ( mod p^(3*r+3) ) for r >= 2 and all primes p >= 3.
These are stronger supercongruences than those satisfied separately by the sequences {binomial(2*n,n)} = A000984 and {binomial(3*n,n)} = A005809.
2) More generally, for k >= 1, the sequence {9*binomial(2*n,n)^k - k*(2^k)*binomial(3*n,n): n >= 0} may satisfy the same supercongruences. This is the case k = 2. See A357509 for the case k = 1.

			Examples of supercongruences:
a(11) - a(1) = 4477160465856 - 12 = (2^2)*3*(11^5)*101*22937 == 0 (mod 11^5).
a(5^2) - a(5) = 143816772358933669354266172512 - 547512 = (2^3)*3*(5^9)*167191* 194659*94271599039 == 0 (mod 5^9).

Paolo Xausa, Table of n, a(n) for n = 0..800
C. Helou and G. Terjanian, On Wolstenholme’s theorem and its converse, J. Number Theory 128 (2008), 475-499.
Romeo Meštrović, Wolstenholme's theorem: Its Generalizations and Extensions in the last hundred and fifty years (1862-2011), arXiv preprint arXiv:1111.3057 [math.NT], 2011.

Cf. A000984, A002894, A005809, A357509, A357567, A357569, A357955.

seq(9*binomial(2*n,n)^2 - 8*binomial(3*n,n), n = 0..20);

A357568[n_] := 9*Binomial[2*n, n]^2 - 8*Binomial[3*n, n];
Array[A357568, 25, 0] (* Paolo Xausa, Jul 17 2024 *)

a(n) = 9*A002894(n) - 8*A005809(n) = 9*A000984(n)^2 - 8*A005809(n). .
a(k*p^r) == a(k*p^(r-1)) ( mod p^(3*r) ) for positive integers k and r and for all primes p >= 5 (see Meštrović, Section 6, equation 39).
a(p) == a(1) (mod p^5) for all primes p >= 7 (apply Helou and Terjanian, Section 3, Proposition 2).
From Stefano Spezia, Jul 17 2024: (Start)
G.f.: 16*cos(arccos(1-27*x/2)/6)/sqrt(4-27*x) + 18*EllipticK(16*x)/Pi.
E.g.f.: 9*hypergeom([1/2, 1/2], [1, 1], 16*x) - 8*hypergeom([1/3, 2/3], [1/2, 1], 27*x/4).
a(n) ~ 9*2^(4*n)/(n*Pi). (End)

A001451 a(n) = (5n)!/((3n)!n!n!).

Original entry on oeis.org

1, 20, 1260, 100100, 8817900, 823727520, 79919739900, 7962100660800, 808906548235500, 83426304143982800, 8707404737345073760, 917663774856743842200, 97491279924241456098300, 10427604345391237790688000, 1121786259855036145008408000

Offset: 0

N. J. A. Sloane

From Peter Bala, Jul 15 2016: (Start)
This sequence occurs as the right-hand side of the binomial sum identity Sum_{k = 0..n} (-1)^(k)*binomial(n,k)*binomial(2*n + k,n)*binomial(3*n - k,n) = (-1)^m*a(m) for n = 2*m. The sum vanishes for n odd. Cf. A273628 and A273629.
Note the similar results:
Sum_{k = 0..n} (-1)^k*binomial(n,k)* binomial(2*n + k,n)*binomial(3*n + k,n) = (-1)^n*(3*n)!/n!^3 = (-1)^n*A006480(n);
Sum_{k = 0..n} (-1)^k*binomial(n,k)*binomial(2*n - k,n)*binomial(3*n - k,n) = binomial(2*n,n)^2 = A002894(n);
Sum_{k = 0..2*n} (-1)^k*binomial(2*n,k)*binomial(2*n + k,n)*binomial(3*n + k,n) = Sum_{k = 0..2*n} (-1)^k*binomial(2*n,k)*binomial(2*n - k,n)*binomial(3*n - k,n) = binomial(2*n,n) = A000984(n);
Sum_{k = 0..2*n} (-1)^k*binomial(2*n,k)*binomial(2*n + k,n)*binomial(3*n - k,n) = Sum_{k = 0..2*n} (-1)^k*binomial(2*n,k)*binomial(2*n - k,n)*binomial(3*n + k,n) = (-1)^n*binomial(2*n,n) = (-1)^n*A000984(n). (End)
Choose three noncollinear step vectors to satisfy the zero sum, 3*v_1 + v_2 + v_3 = 0. Then a(n) is the number of loop plane walks of length 5*n which depart from and return to the origin. Equivalently, a(n) counts distinct permutations of a (5*n)-digit integer with digits 1,2,3 of multiplicity 3*n,n,n respectively. - Bradley Klee, Aug 12 2018

			G.f. = 1 + 20*x + 1260*x^2 + 100100*x^3 + 8817900*x^4 + 823727520*x^5 + ... - _Michael Somos_, Aug 12 2018

Vincenzo Librandi, Table of n, a(n) for n = 0..200

Cf. A000897, A002894, A002897, A006480, A008977, A186420, A188662, A273628, A273629.

List([0..15],n->Factorial(5*n)/(Factorial(3*n)*Fact0rial(n)*Factorial(n))); # Muniru A Asiru, Aug 12 2018

[Factorial(5*n)/(Factorial(3*n)*Factorial(n)*Factorial(n)): n in [0..30]]; // Vincenzo Librandi, May 22 2011

Maple
```
f := n->(5*n)!/((3*n)!*n!*n!);
```

Table[(5*n)!/((3*n)!*n!*n!), {n, 0, 20}] (* Vincenzo Librandi, Sep 04 2012 *)

a(n) = binomial(4*n,n)*binomial(5*n,n) = ( [x^n](1 + x)^(4*n) ) * ( [x^n](1 + x)^(5*n) ) = [x^n](F(x)^(20*n)), where F(x) = 1 + x + 12*x^2 + 390*x^3 + 16984*x^4 + 867042*x^5 + 48848541*x^6 + ... appears to have integer coefficients. For similar results see A000897, A002894, A002897, A006480, A008977, A186420 and A188662. - Peter Bala, Jul 14 2016
a(n) ~ 3^(-3*n-1/2)*5^(5*n+1/2)/(2*Pi*n). - Ilya Gutkovskiy, Jul 13 2016
G.f.: G(x) = 4F3(1/5,2/5,3/5,4/5;1/3,2/3,1;(5^5/3^3)*x). Let G^(n)(x) = d^n/dx^n G(x), and c = {120, 15000*x-6, 45000*x^2-114*x, 25000*x^3-135*x^2, 3125*x^4-27*x^3}, then Sum_{n=0..4} c_n*G^(n)(x) = 0. - Bradley Klee, Aug 12 2018
From Peter Bala, Mar 20 2022: (Start)
Right-hand side of the following identities valid for n >= 1:
Sum_{k = 0..3*n} 2*n*(2*n+k-1)!/(k!*n!^2) = (5*n)!/((3*n)!*n!^2);
Sum_{k = 0..n} 4*n*(4*n+k-1)!/(k!*n!*(3*n)!) = (5*n)!/((3*n)!*n!^2). Cf. A000897 and A113424. (End)
a(n) = Sum_{k = 0..n} (-1)^(n+k) * binomial(n, k) * A108625(4*n, k) (verified using the MulZeil procedure in Doron Zeilberger's MultiZeilberger package). - Peter Bala, Oct 12 2024

A287318 Square array A(n,k) = (2n)! [x^n] BesselI(0, 2sqrt(x))^k read by antidiagonals.

Original entry on oeis.org

1, 1, 0, 1, 2, 0, 1, 4, 6, 0, 1, 6, 36, 20, 0, 1, 8, 90, 400, 70, 0, 1, 10, 168, 1860, 4900, 252, 0, 1, 12, 270, 5120, 44730, 63504, 924, 0, 1, 14, 396, 10900, 190120, 1172556, 853776, 3432, 0, 1, 16, 546, 19920, 551950, 7939008, 32496156, 11778624, 12870, 0

Offset: 0

Peter Luschny, May 23 2017

			Arrays start:
  k\n| 0   1    2      3        4          5           6
  ---|---------------------------------------------------------
  k=0| 1,  0,   0,     0,       0,         0,            0, ... A000007
  k=1| 1,  2,   6,    20,      70,       252,          924, ... A000984
  k=2| 1,  4,  36,   400,    4900,     63504,       853776, ... A002894
  k=3| 1,  6,  90,  1860,   44730,   1172556,     32496156, ... A002896
  k=4| 1,  8, 168,  5120,  190120,   7939008,    357713664, ... A039699
  k=5| 1, 10, 270, 10900,  551950,  32232060,   2070891900, ... A287317
  k=6| 1, 12, 396, 19920, 1281420,  96807312,   8175770064, ... A356258
  k=7| 1, 14, 546, 32900, 2570050, 238935564,  25142196156, ...
  k=8| 1, 16, 720, 50560, 4649680, 514031616,  64941883776, ...
  k=9| 1, 18, 918, 73620, 7792470, 999283068, 147563170524, ...

Nikolai Beluhov, Powers of 2 in High-Dimensional Lattice Walks, arXiv:2506.12789 [math.CO], 2025. See p. 19.

Rows: A000007 (k=0), A000984 (k=1), A002894 (k=2), A002896 (k=3), A039699 (k=4), A287317 (k=5), A356258 (k=6).
Columns: A005843 (n=1), A152746 (n=2), 20*A169711 (n=3), 70*A169712 (n=4), 252*A169713 (n=5).
Main diagonal gives A303503.
Cf. A287316.

A287318_row := proc(k, len) local b, ser;
b := k -> BesselI(0, 2*sqrt(x))^k: ser := series(b(k), x, len);
seq((2*i)!*coeff(ser,x,i), i=0..len-1) end:
for k from 0 to 6 do A287318_row(k, 9) od;

Table[Table[SeriesCoefficient[BesselI[0, 2 Sqrt[x]]^k, {x, 0, n}] (2 n)!, {n, 0, 6}], {k, 0, 6}]

A(n,k) = A287316(n,k) * binomial(2*n,n).

cp's OEIS Frontend

A229648 Cogrowth function of the group Baumslag-Solitar(6,6).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A229649 Cogrowth function of the group Baumslag-Solitar(7,7).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A229650 Cogrowth function of the group Baumslag-Solitar(8,8).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A229651 Cogrowth function of the group Baumslag-Solitar(9,9).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A229652 Cogrowth function of the group Baumslag-Solitar(10,10).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A275652 a(n) = binomial(3*n,3*n/2)*binomial(2*n,n)*binomial(5*n/2,n/2)/binomial(n,n/2).

Views

Author

Keywords

Comments

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

A053175 Catalan-Larcombe-French sequence.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Formula

A357568 a(n) = 9*binomial(2*n,n)^2 - 8*binomial(3*n,n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A275652 a(n) = binomial(3n,3n/2)binomial(2n,n)binomial(5n/2,n/2)/binomial(n,n/2).

A357568 a(n) = 9binomial(2n,n)^2 - 8binomial(3n,n).

A001451 a(n) = (5n)!/((3n)!n!n!).

A287318 Square array A(n,k) = (2n)! [x^n] BesselI(0, 2sqrt(x))^k read by antidiagonals.