|
|
A023148
|
|
Numbers k such that prime(k) == 6 (mod k).
|
|
12
|
|
|
1, 5, 79, 445, 16055, 27067045, 1208198549, 1208198609, 1208198615, 2636913002983, 885992692751479, 885992692751483, 885992692751833, 43525513764815035, 43525513764815057, 43525513764815173, 43525513764816367
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
NextPrim[n_] := Block[{k = n + 1}, While[ !PrimeQ[k], k++ ]; k]; p = 1; Do[ If[ Mod[p = NextPrim[p], n] == 6, 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 - 6) % n == 0 : terms.append(n)
p = next_prime(p)
return terms
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|