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!)
A275652 a(n) = binomial(3*n,3*n/2)*binomial(2*n,n)*binomial(5*n/2,n/2)/binomial(n,n/2). 10
1, 10, 300, 11440, 485100, 21841260, 1022041020, 49128552000, 2408829328620, 119918393838100, 6042249840712800, 307438844121252480, 15770112362658517500, 814459593645444166560, 42308586942403276440000, 2208850973597860123741440, 115825519836558228435979500 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
COMMENTS
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.
LINKS
FORMULA
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
MAPLE
seq(simplify(factorial(3*n)*factorial(n/2)*factorial(5*n/2)/(factorial(n)^3*factorial(3*n/2)^2)), n = 0 .. 20);
MATHEMATICA
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 *)
PROG
(PARI) a(n) = sum(k = 0, n, binomial(2*n-k-1, n-k)*binomial(3*n, k)^2); \\ Michel Marcus, Apr 21 2022
(Python)
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
CROSSREFS
Sequence in context: A129005 A162729 A278037 * A221953 A293963 A152165
KEYWORD
nonn,easy
AUTHOR
Peter Bala, Aug 04 2016
STATUS
approved

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 March 28 08:22 EDT 2024. Contains 371236 sequences. (Running on oeis4.)