login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A017786
Binomial coefficients C(70,n).
3
1, 70, 2415, 54740, 916895, 12103014, 131115985, 1198774720, 9440350920, 65033528560, 396704524216, 2163842859360, 10638894058520, 47465835030320, 193253756909160, 721480692460864, 2480089880334220, 7877932561061640, 23196134763125940
OFFSET
0,2
COMMENTS
Row 70 of A007318.
LINKS
Nathaniel Johnston, Table of n, a(n) for n = 0..70 (full sequence)
FORMULA
From G. C. Greubel, Nov 14 2018: (Start)
G.f.: (1+x)^70.
E.g.f.: 1F1(-70; 1; -x), where 1F1 is the confluent hypergeometric function. (End)
MAPLE
seq(binomial(70, n), n=0..70); # Nathaniel Johnston, Jun 24 2011
MATHEMATICA
Binomial[70, Range[0, 70]] (* G. C. Greubel, Nov 14 2018 *)
PROG
(Sage) [binomial(70, n) for n in range(17)] # Zerinvary Lajos, May 28 2009
(PARI) vector(70, n, n--; binomial(70, n)) \\ G. C. Greubel, Nov 14 2018
(Magma) [Binomial(70, n): n in [0..70]]; // G. C. Greubel, Nov 14 2018
KEYWORD
nonn,fini,full,easy
STATUS
approved