|
|
A067185
|
|
Numbers k such that prime(k+1) + prime(k) == 1 (mod k).
|
|
3
|
|
|
1, 7, 17, 109, 281, 1669, 6592663, 16899113, 16899145, 16899295, 749973611, 5067034877, 5067034925, 34487825911, 1626582230375
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MATHEMATICA
|
a = b = 0; Do[b = Prime[n + 1]; If[Mod[a + b, n] == 1, Print[n]]; a = b, {n, 1, 10^9}]
|
|
PROG
|
(Sage)
terms = []
p = 2
for n in range(1, max + 1):
q = next_prime(p)
if not (p + q - 1) % n:
terms.append(n)
p = q
return terms
(PARI) isok(k) = (prime(k+1) + prime(k)) % k == 1; \\ Michel Marcus, Feb 17 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|