|
|
A103966
|
|
Let p(k) = k-th prime. a(n) = smallest prime p(j) such that number of solutions to p(k)-p(k-1)=m is n, where 1<k<=j.
|
|
1
|
|
|
3, 7, 13, 19, 31, 43, 61, 73, 103, 109, 131, 151, 181, 193, 199, 229, 241, 271, 283, 313, 349, 389, 433, 449, 491, 503, 563, 569, 577, 593, 599, 607, 613, 653, 659, 683, 733, 739, 757, 947, 953, 977
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
EXAMPLE
|
a(2)=7 since if m=2, then there are two solutions (7-5=2), (5-3=2).
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|