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 A061924 #19 Sep 02 2023 04:32:38
%S A061924 1,4,56,1320,43680,1860480,96909120,5967561600,424097856000,
%T A061924 34162713446400,3075990524006400,306135476264217600,
%U A061924 33371339479827148800,3954242643911239680000,506046613478104258560000,69560546966425756200960000,10221346459144248675287040000
%N A061924 Number of combinations in card games with 4 suits and 4 players.
%H A061924 Harry J. Smith, <a href="/A061924/b061924.txt">Table of n, a(n) for n=0..100</a>
%H A061924 Frank Ellermann, <a href="/A061924/a061924.txt">Illustration for A001400, A061924</a>
%F A061924 a(n) = (4*n)! / (4*n-n)!
%F A061924 E.g.f. in Maple notation: hypergeom([1/2, 1/4, 3/4], [1/3, 2/3], 256*x/27). - _Karol A. Penson_, Oct 18 2001
%e A061924 a(13) = 52*51*50*49*48*47*46*45*44*43*42*41*40 (Whist, Bridge).
%t A061924 Table[(4n)!/(4n-n)!,{n,0,20}] (* _Harvey P. Dale_, Aug 20 2012 *)
%o A061924 (PARI) { for (n=0, 100, write("b061924.txt", n, " ", (4*n)! / (4*n - n)!) ) } \\ _Harry J. Smith_, Jul 29 2009
%o A061924 (Python)
%o A061924 from sympy import ff
%o A061924 def A061924(n): return ff(n<<2,n) # _Chai Wah Wu_, Sep 01 2023
%Y A061924 Cf. A001400.
%K A061924 nonn,easy
%O A061924 0,2
%A A061924 _Frank Ellermann_, May 16 2001
%E A061924 More terms from _Harvey P. Dale_, Aug 20 2012