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 A056110 #16 Oct 07 2019 11:15:21
%S A056110 1,1,1,17,1,1,1753,32989,125131,3070523,1,3593203,1,76922021647,
%T A056110 6880233439,18720390952421,108514808571661,186286524362683,
%U A056110 19499250680671,2221345311813453913,10311933282363373211,498390560021687969,991459181683,104102080827724738147651,19739193437746837432529
%N A056110 Highest proper factor of n!-1, or a(n)=1 if n!-1 is not composite.
%H A056110 Amiram Eldar, <a href="/A056110/b056110.txt">Table of n, a(n) for n = 2..135</a>
%H A056110 Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha105.htm">Factorizations of many number sequences: n! - 1 (n = 1 to 100)</a>.
%H A056110 R. G. Wilson v, <a href="/A038507/a038507.txt">Explicit factorizations</a>
%F A056110 a(n) = A033312(n)/A054415(n)
%t A056110 pf[n_]:=Module[{c=n!-1},If[PrimeQ[c],1,c/FactorInteger[c][[1,1]]]]; Array[pf,30,2] (* _Harvey P. Dale_, Dec 13 2012 *)
%o A056110 (PARI) A056110(n)={n=factor(n!-1);if(norml2(n[,2])>1,factorback(n)/n[1,1],1)} \\ _M. F. Hasler_, Oct 31 2012
%Y A056110 Cf. A002582.
%K A056110 nonn
%O A056110 2,4
%A A056110 _Henry Bottomley_, Jun 12 2000
%E A056110 Edited and extended by _M. F. Hasler_, Oct 31 2012