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 A076000 #12 Jun 24 2021 17:34:19
%S A076000 1,1,2,3,12,20,120,315,1680,6048,60480,138600,1663200,9266400,
%T A076000 69189120,340540200,5448643200,22870848000,411675264000,2111894104320,
%U A076000 24135932620800,230388447744000,5068545850368000
%N A076000 a(n) = Product_{k=1..n} k/floor(n/k).
%C A076000 Sketch of proof that a(n) is an integer from Paul R. Pudaite, 9/28/2002: 1. n! = Product{p^([n/p]+[n/p^2]+...): prime p <= n}. 2. Product{[n/k]: k = 1...n} = Product{i^([n/i]-[n/i+1]): i=2...n}. 3. = Product{Product{Product{p^([n/i]-[n/i+1]): i such that p^k|i}: k such that p^k <= n}: prime p <= n}. 4. Reorganizing the exponents in the innermost product: ([n/p^k] - [n/(p^k+1)]) + ([n/(2 p^k)] - [n/(2 p^k + 1)] + ... = [n/p^k] - ([n/(p^k+1)] - [n/(2 p^k)]) - ... <= [n/p^k].
%F A076000 a(n) = n!/A010786(n).
%e A076000 a(6) = 6*5*4*3*2*1/([6/1]*[6/2]*[6/3]*[6/4]*[6/5]*[6/6]) = 6!/(6*3*2*1*1*1) = 20, where [x] denotes the greatest integer <= x.
%t A076000 Table[Product[k/Floor[n/k],{k,n}],{n,30}] (* _Harvey P. Dale_, Feb 27 2013 *)
%o A076000 (PARI) a(n) = prod(k=1, n, k/(n\k)); \\ _Michel Marcus_, Jun 24 2021
%Y A076000 Cf. A010786, A345684.
%K A076000 nonn
%O A076000 1,3
%A A076000 _Clark Kimberling_, Sep 29 2002