|
|
A023152
|
|
Numbers k such that prime(k) == 10 (mod k).
|
|
18
|
|
|
1, 7, 19, 21, 2703, 15929, 4124583, 27067051, 179992913, 179993011, 179993159, 1208198559, 1208198859, 55762149031, 382465573511, 382465573547, 18262325820337, 6201265271239229, 6201265271239409, 6201265271239433, 43525513764814941, 43525513764816369, 43525513764816411, 43525513764816437, 306268030480171419
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MATHEMATICA
|
NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 10, Print[n]], {n, 1, 10^9}] (* Robert G. Wilson v, Feb 18 2004 *)
|
|
PROG
|
(Sage)
terms = []
p = 2
for n in range(1, max+1) :
if (p - 10) % n == 0 : terms.append(n)
p = next_prime(p)
return terms
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|