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 A061370 #15 Dec 07 2024 17:09:05
%S A061370 1,0,1,2,8,34,180,1120,8064,65978,604800,6141046,68428800,830269440,
%T A061370 10897286400,153844043294,2324754432000,37440781904842,
%U A061370 640237370572800,11585247657984000,221172909834240000,4442690623626907826
%N A061370 a(n) = floor(ratio of product and sum of first n numbers).
%H A061370 Harry J. Smith, <a href="/A061370/b061370.txt">Table of n, a(n) for n = 1..100</a>
%F A061370 a(n) = floor(2*(n-1)! / (n+1)).
%e A061370 a(6) = floor(720/21) = 34.
%p A061370 a:=n->floor(mul(j,j=1..n)/sum(j,j=1..n)):seq(a(n),n=1..23); # _Zerinvary Lajos_, Dec 07 2008
%t A061370 Table[ Floor[2*(n - 1)!/(n + 1)], {n, 1, 24} ]
%o A061370 (PARI) a(n) = { 2*(n-1)! \ (n+1) } \\ _Harry J. Smith_, Jul 22 2009
%K A061370 nonn,easy
%O A061370 1,4
%A A061370 _Amarnath Murthy_, May 02 2001
%E A061370 More terms from Larry Reeves (larryr(AT)acm.org), May 07 2001