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.

A004313 a(n) = binomial coefficient C(2n, n-7).

Original entry on oeis.org

1, 16, 153, 1140, 7315, 42504, 230230, 1184040, 5852925, 28048800, 131128140, 600805296, 2707475148, 12033222880, 52860229080, 229911617056, 991493848554, 4244421484512, 18053528883775, 76360380541900, 321387366339585, 1346766106565880, 5621728217559090
Offset: 7

Views

Author

Keywords

References

  • M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.

Crossrefs

Diagonal 15 of triangle A100257.
Cf. A001622.

Programs

Formula

-(n-7)*(n+7)*a(n) + 2*n*(2*n-1)*a(n-1) = 0. - R. J. Mathar, Jan 24 2018
E.g.f.: BesselI(7,2*x)*exp(2*x). - Ilya Gutkovskiy, Jun 27 2019
From Amiram Eldar, Aug 27 2022: (Start)
Sum_{n>=7} 1/a(n) = 41*Pi/(9*sqrt(3)) - 24923/3465.
Sum_{n>=7} (-1)^(n+1)/a(n) = 51094*log(phi)/(5*sqrt(5)) - 7616722/3465, where phi is the golden ratio (A001622). (End)