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 A071248 #19 Jun 12 2019 16:06:34
%S A071248 1,4,54,768,75000,466560,592950960,5284823040,1735643790720,
%T A071248 45360000000000,1035338990313196800,102980960177356800,
%U A071248 145077660657859734604800,154452450072526199193600
%N A071248 a(n) = Product_{k=1..n} lcm(n,k).
%C A071248 Log(a(n))/n/Log(n) is bounded since n^n < a(n) < n^(2n). It seems that lim n -> infinity Log(a(n))/n/Log(n) exists and = 1.7.... - _Benoit Cloitre_, Aug 13 2002
%H A071248 T. D. Noe, <a href="/A071248/b071248.txt">Table of n, a(n) for n=1..100</a>
%F A071248 a(n) = n!*Product_{ d divides n } d^phi(d). - _Vladeta Jovovic_, Sep 10 2004
%F A071248 a(n) = n!*n^n/A067911(n)=A000142(n)*A000312(n)/A067911(n). - _R. J. Mathar_, Apr 03 2007
%p A071248 A071248 := proc(n) mul( lcm(k,n),k=1..n) ; end: for n from 1 to 10 do printf("%d ",A071248(n)) ; od ; # _R. J. Mathar_, Apr 03 2007
%t A071248 Table[Product[LCM[k,n],{k,n}],{n,20}] (* _Harvey P. Dale_, Jun 12 2019 *)
%o A071248 (PARI) a(n)=prod(k=1,n,lcm(n,k))
%Y A071248 Product of terms in n-th row of A051173.
%Y A071248 Cf. A067911, A056916, A055774.
%K A071248 nonn
%O A071248 1,2
%A A071248 _Amarnath Murthy_, May 21 2002
%E A071248 More terms from _Benoit Cloitre_, Aug 13 2002