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 A056111 #15 Oct 07 2019 11:28:49 %S A056111 1,1,1,1,5,11,103,71,661,19099,329891,1,36846277,75024347,3790360487, %T A056111 22163972339,1230752346353,538105034941,336967037143579, %U A056111 1713311273363831,117876683047,1188161445853707907,48869596859895986087,550042909337978226383,765041185860961084291 %N A056111 Highest proper factor of n!+1. %H A056111 Amiram Eldar, <a href="/A056111/b056111.txt">Table of n, a(n) for n = 0..139</a> %H A056111 Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha104.htm">Factorizations of many number sequences</a> %H A056111 Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha103.htm">Factorizations of many number sequences</a> %H A056111 R. G. Wilson v, <a href="/A038507/a038507.txt">Explicit factorizations</a> %F A056111 a(n) = A038507(n)/A051301(n). %t A056111 a[n_] := Divisors[n!+1][[ -2]] %Y A056111 Cf. A002583, A038507, A051301, A056110. %K A056111 nonn %O A056111 0,5 %A A056111 _Henry Bottomley_, Jun 12 2000 %E A056111 Corrected and extended by _Dean Hickerson_, Aug 30 2001 %E A056111 More terms from _Amiram Eldar_, Oct 07 2019