bibkey: perry2004a094802 authors: Jon Perry year: 2004 title: “OEIS A094802, a(n) = smallest k such that all of 1 through n divides k!” doi: null url: https://oeis.org/A094802 claim: “%N A094802 a(n) = smallest k such that all of 1 through n divides k!. %C A094802 It is conjectured that after n=4 the sequence is prime for n prime or the previous prime for n not prime.” strata_touched:

• D5/S3/Factorization/PerryLeastFactorialDivisibleByPrefixLcm license: citation-only triage: anchor

OEIS A094802

The NAME and COMMENT of the entry state:

%N A094802 a(n) = smallest k such that all of 1 through n divides k!. %C A094802 It is conjectured that after n=4 the sequence is prime for n prime or the previous prime for n not prime.

The AUTHOR and OFFSET lines state:

%A A094802 Jon Perry, Jun 11 2004 %O A094802 1,2

Verified locator

• URL: https://oeis.org/A094802
• NAME (verbatim): %N A094802 a(n) = smallest k such that all of 1 through n divides k!.
• COMMENT (verbatim): %C A094802 It is conjectured that after n=4 the sequence is prime for n prime or the previous prime for n not prime.
• AUTHOR (verbatim): %A A094802 Jon Perry, Jun 11 2004
• OFFSET (verbatim): %O A094802 1,2

The current revision #10 (Apr 01 2024 12:14:58) still carries the conjecture without a settlement. For a prime n, its largest prime at most n is n; for a composite n, it is the previous prime. The restriction n >= 5 is necessary: a(4) = 4 is not prime.