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.
%I A004347 #24 Mar 19 2025 09:12:22
%S A004347 1,30,595,9880,148995,2118760,28989675,386206920,5047381560,
%T A004347 65033528560,828931106355,10477677064400,131567066917650,
%U A004347 1643385429346680,20439879147794485,253338471349988640
%N A004347 Binomial coefficient C(5n,n-5).
%D A004347 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.
%H A004347 Vincenzo Librandi, <a href="/A004347/b004347.txt">Table of n, a(n) for n = 5..940</a>
%H A004347 M. Abramowitz and I. A. Stegun, eds., <a href="http://www.convertit.com/Go/ConvertIt/Reference/AMS55.ASP">Handbook of Mathematical Functions</a>, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
%F A004347 From _Ilya Gutkovskiy_, Jan 31 2017: (Start)
%F A004347 E.g.f.: (1/120)*x^5*4F4(26/5,27/5,28/5,29/5; 13/2,27/4,7,29/4; 3125*x/256).
%F A004347 a(n) ~ 5^(5*n+1/2)/(sqrt(Pi*n)*2^(8*n+23/2)). (End)
%F A004347 D-finite with recurrence -8*(4*n+5)*(n-5)*(2*n+1)*(4*n+3)*(n+1)*a(n) +5*n*(5*n-4)*(5*n-3)*(5*n-2)*(5*n-1)*a(n-1)=0. - _R. J. Mathar_, Mar 19 2025
%t A004347 Table[Binomial[5 n, n - 5], {n, 5, 40}] (* _Vincenzo Librandi_, Feb 01 2017 *)
%o A004347 (Magma) [Binomial(5*n, n-5): n in [5..40]]; // _Vincenzo Librandi_, Feb 01 2017
%K A004347 nonn,easy
%O A004347 5,2
%A A004347 _N. J. A. Sloane_