OFFSET
1,1
COMMENTS
For c<m, (m,c)=1, the Euclid(c, m) set is obtained by deleting from the set of numbers c+m*k, for k>0, every term which has a common factor with a smaller term. See Link for more details.
Essentially the same as A003627, which drops the 8 for 2. - Charles R Greathouse IV, Nov 21 2014
LINKS
Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Andrea Ercolino, XGC - An extension of the Goldbach Conjecture
EXAMPLE
The Euclid(2,3) set is constructed by starting from the set of numbers of the form 2+3*k for k>0, i.e., 5, 8, 11, 14, 17, 20, 23, 26, 29, 32, 35,... and deleting every term which has a common factor with a previous one, like 14, 20, 26, 32, 35,... and so on.
MATHEMATICA
eu[c_, m_, n_] := Block[{v, k=1, p=1}, Table[ While[GCD[v = c + m*k, p] > 1, k++]; p *= v; v, {n}]]; eu[2, 3, 55] (* Giovanni Resta, Mar 14 2014 *)
PROG
(PARI) is(n)=n%3==2 && ((isprime(n) && n>2) || n==8) \\ Charles R Greathouse IV, Nov 21 2014
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Andrea Ercolino (aercolino(AT)yahoo.com)
EXTENSIONS
Edited by Giovanni Resta, Mar 14 2014
STATUS
approved