OFFSET
4,2
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.
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 4..1000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Daniel W. Stasiuk, An Enumeration Problem for Sequences of n-ary Trees Arising from Algebraic Operads, Master's Thesis, University of Saskatchewan-Saskatoon (2018).
FORMULA
From Ilya Gutkovskiy, Jan 31 2017: (Start)
E.g.f.: (1/24)*x^4*3F3(17/4,9/2,19/4; 17/3,6,19/3; 256*x/27).
a(n) ~ 2^(8*n+1/2)/(sqrt(Pi*n)*3^(3*n+9/2)). (End)
MATHEMATICA
Table[Binomial[4n, n-4], {n, 4, 30}] (* Vincenzo Librandi, Feb 01 2017 *)
PROG
(Magma) [Binomial(4*n, n-4): n in [4..30]]; // Vincenzo Librandi, Feb 01 2017
(PARI) a(n)=binomial(4*n, n-4) \\ Charles R Greathouse IV, Feb 01 2017
(Sage) [binomial(4*n, n-4) for n in (4..30)] # G. C. Greubel, Mar 21 2019
(GAP) List([4..30], n-> Binomial(4*n, n-4)) # G. C. Greubel, Mar 21 2019
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
STATUS
approved