cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-12 of 12 results.

A169960 a(n) = binomial(11*n,n).

Original entry on oeis.org

1, 11, 231, 5456, 135751, 3478761, 90858768, 2404808340, 64276915527, 1731030945644, 46897636623981, 1276749965026536, 34898565177533200, 957150015393611193, 26327386978706181060, 725971390105457325456, 20062118235172477959495, 555476984964439251664995
Offset: 0

Views

Author

N. J. A. Sloane, Aug 07 2010

Keywords

Links

Crossrefs

binomial(k*n,n): A000984 (k = 2), A005809 (k = 3), A005810 (k = 4), A001449 (k = 5), A004355 (k = 6), A004368 (k = 7), A004381 (k = 8), A169958 - A169961 (k = 9 thru 12).

Programs

Formula

a(n) = C(11*n-1,n-1)*C(121*n^2,2)/(3*n*C(11*n+1,3)), n>0. - Gary Detlefs, Jan 02 2014
From Peter Bala, Feb 21 2022: (Start)
The o.g.f. A(x) is algebraic: (1 - A(x))*(1 + 10*A(x))^10 + (11^11)*x*A(x)^11 = 0.
Sum_{n >= 1} a(n)*( x*(10*x + 11)^10/(11^11*(1 + x)^11) )^n = x. (End)

A273629 a(n) = (9*n)!/((7*n)!*n!^2).

Original entry on oeis.org

1, 72, 18360, 5920200, 2118223800, 803927196072, 316938365223480, 128313095514575400, 52976845635264939960, 22204947580777261872000, 9418997650746914743158360, 4034374193416822645489549632, 1741969558937890710303111545400
Offset: 0

Views

Author

Peter Bala, Jul 15 2016

Keywords

Comments

This sequence occurs as the right-hand side of the binomial sum identity Sum_{k = 0..n} (-1)^k*binomial(n,k)*binomial(4*n + k,n)*binomial(5*n - k,n) = (-1)^m*a(m) for n = 2*m. The sum vanishes for n odd. For similar results see A001451, A006480 and A273628.
Note the related sums:
Sum_{k = 0..n} (-1)^k*binomial(n,k)*binomial(4*n - k,n)*binomial(5*n - k,n) = binomial(2*n,n)*binomial(4*n,n) = A000984(n)*A005810(n);
Sum_{k = 0..2*n} (-1)^k*binomial(n,k)*binomial(4*n + k,n)*binomial(5*n + k,n) = Sum_{k = 0..2*n} (-1)^k*binomial(n,k)*binomial(4*n - k,n)*binomial(5*n - k,n) = binomial(2*n,n) = A000984(n).
Sum_{k = 0..2*n} (-1)^k*binomial(2*n,k)*binomial(4*n + k,n)*binomial(5*n - k,n) = Sum_{k = 0..2*n} (-1)^k*binomial(2*n,k)*binomial(4*n - k,n)*binomial(5*n + k,n) = (-1)^n*binomial(2*n,n) = (-1)^n*A000984(n).

Crossrefs

Cf. A000984, A001451, A004381, A005810, A006480, A008979, A169958, A245086, A273628.

Programs

  • Magma
    [Factorial(9*n)/(Factorial(7*n)*Factorial(n)^2): n in [0..40]]; // Vincenzo Librandi, Jul 17 2016
  • Maple
    seq((9*n)!/((7*n)!*n!^2), n = 0..20);
  • Mathematica
    Table[Factorial[9 n] / (Factorial[7 n] Factorial[n]^2), {n, 0, 20}] (* Vincenzo Librandi, Jul 17 2016 *)

Formula

a(n) = (9*n)!/((7*n)!*n!^2) = binomial(9*n,2*n)* binomial(2*n,n).
a(n) = binomial(8*n,n)*binomial(9*n,n) = A004381(n)*A169958(n).
a(n) = [x^n](1 + x)^(8*n) * [x^n] (1 + x)^(9*n).
It appears that a(n) = [x^n] F(x)^(72*n), where F(x) = 1 + x + 56*x^2 + 7700*x^3 + 1422008*x^4 + 307144278*x^5 + 73118586828*x^6 + ... has all integer coefficients. Cf. A273628 and A008979.
Recurrence: 7*n^2*(7*n - 1)*(7*n - 2)*(7*n - 3)*(7*n - 4)*(7*n - 5)*(7*n - 6)*a(n) = 9*(9*n - 1)*(9*n - 2)*(9*n - 3)*(9*n - 4)*(9*n - 5)*(9*n - 6)*(9*n - 7)*(9*n - 8)*a(n-1).
a(n) ~ 3^(18*n+1)*7^(-7*n-1/2)/(2*Pi*n). - Ilya Gutkovskiy, Jul 15 2016
a(n) = Sum_{k = 0..n} (-1)^(n+k) * binomial(n, k) * A108625(8*n, k) (verified using the MulZeil procedure in Doron Zeilberger's MultiZeilberger package). - Peter Bala, Oct 15 2024
Previous Showing 11-12 of 12 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.