Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Oct 07 2019 11:28:49
%S 1,1,1,1,5,11,103,71,661,19099,329891,1,36846277,75024347,3790360487,
%T 22163972339,1230752346353,538105034941,336967037143579,
%U 1713311273363831,117876683047,1188161445853707907,48869596859895986087,550042909337978226383,765041185860961084291
%N Highest proper factor of n!+1.
%H Amiram Eldar, <a href="/A056111/b056111.txt">Table of n, a(n) for n = 0..139</a>
%H Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha104.htm">Factorizations of many number sequences</a>
%H Hisanori Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/matha1/matha103.htm">Factorizations of many number sequences</a>
%H R. G. Wilson v, <a href="/A038507/a038507.txt">Explicit factorizations</a>
%F a(n) = A038507(n)/A051301(n).
%t a[n_] := Divisors[n!+1][[ -2]]
%Y Cf. A002583, A038507, A051301, A056110.
%K nonn
%O 0,5
%A _Henry Bottomley_, Jun 12 2000
%E Corrected and extended by _Dean Hickerson_, Aug 30 2001
%E More terms from _Amiram Eldar_, Oct 07 2019