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.

A010974 a(n) = binomial(n,21).

Original entry on oeis.org

1, 22, 253, 2024, 12650, 65780, 296010, 1184040, 4292145, 14307150, 44352165, 129024480, 354817320, 927983760, 2319959400, 5567902560, 12875774670, 28781143380, 62359143990, 131282408400, 269128937220, 538257874440, 1052049481860, 2012616400080, 3773655750150
Offset: 21

Views

Author

Keywords

Comments

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

Crossrefs

Pascal's triangle A007318. - Zerinvary Lajos, Aug 04 2008

Programs

Formula

a(n) = 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)*(n+13)*(n+14)*(n+15)*(n+16)*(n+17)*(n+18)*(n+19)*(n+20) / 21!. - Artur Jasinski, Dec 02 2007
a(n) = n/(n-21) * a(n-1), n > 21. - Vincenzo Librandi, Mar 26 2011
From Amiram Eldar, Dec 11 2020: (Start)
Sum_{n>=21} 1/a(n) = 21/20.
Sum_{n>=21} (-1)^(n+1)/a(n) = A001787(21)*log(2) - A242091(21)/20! = 22020096*log(2) - 42299423848079/2771340 = 0.9580705153... (End)