|
|
A215430
|
|
Smallest integer m such that prime(m) == m (mod prime(n)).
|
|
1
|
|
|
3, 4, 7, 6, 8, 21, 20, 10, 36, 14, 65, 16, 47, 18, 53, 57, 85, 63, 130, 58, 153, 28, 30, 49, 108, 55, 97, 222, 59, 82, 157, 161, 276, 42, 44, 156, 106, 193, 112, 228, 50, 87, 420, 395, 54, 517, 136, 101, 288, 484, 105, 407, 300, 66, 158, 117, 68, 254, 123
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Smallest integer m such that (prime(m)-m) is divisible by prime(n).
|
|
LINKS
|
|
|
EXAMPLE
|
n=1: q=prime(n)=2, m=3, p=prime(m)=5, (p-q)=2, (p-m)/q=1, hence a(1)=3
n=2: q=3, m=4, p=7, (p-q)=3, (p-m)/q=1, hence a(2)=4
n=3: q=5, m=7, p=17, (p-q)=10, (p-m)/q=2, hence a(3)=7.
|
|
MATHEMATICA
|
Reap[Do[q=Prime[n]; m=1; p=2; While[Mod[Prime[m]-m, q]>0, m++]; Sow[m], {n, 100}]][[2, 1]]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|