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

A053672
Least number coprime to n, n+1, n+2 and n+3.
8
5, 7, 7, 11, 11, 5, 11, 7, 7, 7, 5, 11, 11, 11, 7, 5, 7, 11, 13, 13, 5, 7, 7, 7, 11, 5, 11, 11, 7, 7, 5, 13, 13, 11, 11, 5, 7, 7, 11, 11, 5, 13, 7, 7, 7, 5, 11, 11, 11, 7, 5, 7, 13, 13, 13, 5, 7, 7, 7, 11, 5, 11, 17, 7, 7, 5, 11, 11, 11, 11, 5, 7, 7, 13, 17, 5, 17, 7, 7, 7, 5, 11, 11, 11, 7
OFFSET
1,1
LINKS
FORMULA
5 <= a(n) <= (4 + o(1)) log n. - Charles R Greathouse IV, Jun 20 2013
MATHEMATICA
a[n_] := (k = 5; While[ ! (CoprimeQ[k, n] && CoprimeQ[k, n+1] && CoprimeQ[k, n+2] && CoprimeQ[k, n+3]), k++]; k); Table[a[n], {n, 1, 85}](* Jean-François Alcover, Nov 30 2011 *)
Table[Module[{k=3}, While[!And@@CoprimeQ[n+Range[0, 3], Prime[k]], k++]; Prime[k]], {n, 90}] (* Harvey P. Dale, May 10 2012 *)
PROG
(Haskell)
import Data.List (elemIndex)
import Data.Maybe (fromJust)
a053672 n = 2 + fromJust
(elemIndex 1 $ map (gcd $ foldl1 lcm $ take 4 [n..]) [2..])
-- Reinhard Zumkeller, Sep 25 2011
(PARI) a(n)=forprime(p=5, , if((n+3)%p>3, return(p))) \\ Charles R Greathouse IV, Jun 20 2013
CROSSREFS
KEYWORD
nonn,easy,nice
AUTHOR
Henry Bottomley, Feb 15 2000
EXTENSIONS
More terms from James A. Sellers, Feb 22 2000
STATUS
approved