login

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”).

A162564
a(n) is the smallest positive integer neither coprime to n! nor a divisor of n!.
1
4, 4, 9, 9, 14, 22, 22, 22, 22, 26, 26, 34, 34, 34, 34, 38, 38, 46, 46, 46, 46, 58, 58, 58, 58, 58, 58, 62, 62, 74, 74, 74, 74, 74, 74, 82, 82, 82, 82, 86, 86, 94, 94, 94, 94, 106, 106, 106, 106, 106, 106, 118, 118, 118, 118, 118, 118, 122, 122, 134, 134, 134, 134, 134
OFFSET
2,1
COMMENTS
Alternately, smallest composite not dividing n!. For n > 5, twice the smallest prime greater than n. - Charles R Greathouse IV, Apr 04 2013
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 2..10000
FORMULA
a(n) = A160995(n!).
MAPLE
a := proc (n) local j: for j while gcd(j, factorial(n)) = 1 or `mod`(factorial(n), j) = 0 do end do: j end proc: seq(a(n), n = 2 .. 75); # Emeric Deutsch, Jul 23 2009
PROG
(PARI) a(n)=my(N=n!, k=n); while(N%k++==0||isprime(k), ); k \\ Charles R Greathouse IV, Apr 04 2013
(PARI) a(n)=if(n>5, 2*nextprime(n+1), (n\2+1)^2) \\ Charles R Greathouse IV, Apr 04 2013
CROSSREFS
Cf. A160995.
Sequence in context: A168038 A093995 A168280 * A014694 A065730 A246934
KEYWORD
nonn
AUTHOR
Leroy Quet, Jul 06 2009
EXTENSIONS
Extended by Emeric Deutsch, Jul 23 2009
STATUS
approved