The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A056111 Highest proper factor of n!+1. 3
 1, 1, 1, 1, 5, 11, 103, 71, 661, 19099, 329891, 1, 36846277, 75024347, 3790360487, 22163972339, 1230752346353, 538105034941, 336967037143579, 1713311273363831, 117876683047, 1188161445853707907, 48869596859895986087, 550042909337978226383, 765041185860961084291 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 LINKS Amiram Eldar, Table of n, a(n) for n = 0..139 Hisanori Mishima, Factorizations of many number sequences Hisanori Mishima, Factorizations of many number sequences R. G. Wilson v, Explicit factorizations FORMULA a(n) = A038507(n)/A051301(n). MATHEMATICA a[n_] := Divisors[n!+1][[ -2]] CROSSREFS Cf. A002583, A038507, A051301, A056110. Sequence in context: A030085 A022006 A201074 * A090160 A062652 A075706 Adjacent sequences:  A056108 A056109 A056110 * A056112 A056113 A056114 KEYWORD nonn AUTHOR Henry Bottomley, Jun 12 2000 EXTENSIONS Corrected and extended by Dean Hickerson, Aug 30 2001 More terms from Amiram Eldar, Oct 07 2019 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 12 01:37 EDT 2020. Contains 336434 sequences. (Running on oeis4.)