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.

A010966 a(n) = binomial(n,13).

Original entry on oeis.org

1, 14, 105, 560, 2380, 8568, 27132, 77520, 203490, 497420, 1144066, 2496144, 5200300, 10400600, 20058300, 37442160, 67863915, 119759850, 206253075, 347373600, 573166440, 927983760, 1476337800, 2310789600, 3562467300, 5414950296, 8122425444, 12033222880
Offset: 13

Views

Author

Keywords

Comments

In this sequence there are no primes. - Artur Jasinski, Dec 02 2007

Crossrefs

Programs

Formula

a(n) = -A110555(n+1,13). - Reinhard Zumkeller, Jul 27 2005
a(n+12) = n(n+1)(n+2)(n+3)(n+4)(n+5)(n+6)(n+7)(n+8)(n+9)(n+10)(n+11)(n+12)/13!. - Artur Jasinski, Dec 02 2007; R. J. Mathar, Jul 07 2009
G.f.: x^13/(1-x)^14. - Zerinvary Lajos, Aug 06 2008
a(n) = n/(n-13) * a(n-1), n > 13. - Vincenzo Librandi, Mar 26 2011
From Amiram Eldar, Dec 10 2020: (Start)
Sum_{n>=13} 1/a(n) = 13/12.
Sum_{n>=13} (-1)^(n+1)/a(n) = A001787(13)*log(2) - A242091(13)/12! = 53248*log(2) - 102308323/2772 = 0.9366404415... (End)

Extensions

Some formulas for different offsets rewritten by R. J. Mathar, Jul 07 2009