|
|
A002582
|
|
Largest prime factor of n! - 1.
(Formerly M3925 N1613)
|
|
13
|
|
|
1, 5, 23, 17, 719, 5039, 1753, 2999, 125131, 7853, 479001599, 3593203, 87178291199, 1510259, 6880233439, 256443711677, 478749547, 78143369, 19499250680671, 4826713612027, 170006681813, 498390560021687969, 991459181683, 114776274341482621993
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,2
|
|
REFERENCES
|
M. Kraitchik, On the divisibility of factorials, Scripta Math., 14 (1948), 24-26 (but beware errors).
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
|
|
FORMULA
|
Erdős & Stewart show that a(n) > n + (l-o(l))log n/log log n and lim sup a(n)/n > 2. - Charles R Greathouse IV, Dec 05 2012
|
|
MATHEMATICA
|
Table[FactorInteger[n! - 1][[-1, 1]], {n, 2, 25}] (* Harvey P. Dale, Aug 29 2011 *)
|
|
PROG
|
(Magma) [1] cat [Maximum(PrimeDivisors(Factorial(n)-1)): n in [3..30]]; // Vincenzo Librandi, Feb 14 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|