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

A190911
Least number coprime to n and n+3.
2
3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 11, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 11, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3, 7, 3, 3, 7, 3, 3, 5, 3, 3, 5, 3, 3, 5, 3, 3
OFFSET
1,1
COMMENTS
This is to n+3 as A053670 is to n+1. This is the 3rd row of the array A(k,n) = Least number coprime to n and n+k where A053670 is the 1st row. First n for which a(n) = (3, 5, 7, 11, 13, 17, 19, ...) are A191112 = (1, 3, 12, 42, 165, 3000, 2142, ...).
LINKS
EXAMPLE
a(12) = 7 because the prime factors of 12 and 12+3 = 15 are {2, 3, 5} and the next available prime is 7.
MAPLE
A190911 := proc(n) local k: for k from 3 by 2 do if(gcd(k, n)=1 and gcd(k, n+3)=1)then return k: fi: od: end: seq(A190911(n), n=1..100); # Nathaniel Johnston, May 26 2011
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Jonathan Vos Post, May 26 2011
EXTENSIONS
a(15) corrected by Nathaniel Johnston, May 26 2011
STATUS
approved