|
|
A073125
|
|
a(n) is the least prime p(s) such that prime(s+n) - prime(s) is divisible by n.
|
|
3
|
|
|
2, 3, 17, 5, 17, 5, 13, 29, 2, 13, 17, 11, 7, 11, 7, 7, 11, 7, 7, 67, 5, 47, 193, 43, 3, 3, 5, 53, 173, 41, 181, 31, 181, 41, 211, 31, 211, 181, 113, 29, 173, 13, 173, 19, 229, 181, 197, 17, 193, 13, 113, 17, 113, 619, 191, 13, 179, 173, 167, 743, 1499, 7, 1627, 733
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
n=1: a(1)=2 because 3 - 2 = 1 is divisible by 1.
n=10: a(10) = 13 = p(6) because p(6+10) - 13 = p(16) - 13 = 53 - 13 = 40 is divisible by 10.
|
|
MATHEMATICA
|
Table[s = 1; While[! Divisible[Prime[s + n] - Set[p, Prime@s], n], s++]; p, {n, 64}] (* Michael De Vlieger, Jul 30 2017 *)
|
|
PROG
|
(PARI) a(n) = {s = 1; while ((prime(s+n) - prime(s)) % n, s++); prime(s); } \\ Michel Marcus, Dec 26 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|