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”).

Binomial coefficients C(64,n).
3

%I #23 Jun 28 2023 21:47:50

%S 1,64,2016,41664,635376,7624512,74974368,621216192,4426165368,

%T 27540584512,151473214816,743595781824,3284214703056,13136858812224,

%U 47855699958816,159518999862720,488526937079580,1379370175283520,3601688791018080

%N Binomial coefficients C(64,n).

%C Row 64 of A007318.

%H Nathaniel Johnston, <a href="/A017780/b017780.txt">Table of n, a(n) for n = 0..64</a> (full sequence)

%F From _G. C. Greubel_, Nov 14 2018: (Start)

%F G.f.: (1+x)^64.

%F E.g.f.: 1F1(-64; 1; -x), where 1F1 is the confluent hypergeometric function. (End)

%p seq(binomial(64,n), n=0..64); # _Nathaniel Johnston_, Jun 24 2011

%t Binomial[64, Range[0,64]] (* _G. C. Greubel_, Nov 14 2018 *)

%o (Sage) [binomial(64, n) for n in range(18)] # _Zerinvary Lajos_, May 28 2009

%o (PARI) vector(64, n, n--; binomial(64,n)) \\ _G. C. Greubel_, Nov 14 2018

%o (Magma) [Binomial(64,n): n in [0..64]]; // _G. C. Greubel_, Nov 14 2018

%Y Cf. A010926-A011001, A017765-A017779, A017781-A017816.

%K nonn,fini,full,easy

%O 0,2

%A _N. J. A. Sloane_