|
%I #11 Aug 10 2012 22:18:35
%S 3,4,7,6,8,21,20,10,36,14,65,16,47,18,53,57,85,63,130,58,153,28,30,49,
%T 108,55,97,222,59,82,157,161,276,42,44,156,106,193,112,228,50,87,420,
%U 395,54,517,136,101,288,484,105,407,300,66,158,117,68,254,123
%N Smallest integer m such that prime(m) == m (mod prime(n)).
%C Smallest integer m such that (prime(m)-m) is divisible by prime(n).
%H Zak Seidov, <a href="/A215430/b215430.txt">Table of n, a(n) for n = 1..10000</a>
%e n=1: q=prime(n)=2, m=3, p=prime(m)=5, (p-q)=2, (p-m)/q=1, hence a(1)=3
%e n=2: q=3, m=4, p=7, (p-q)=3, (p-m)/q=1, hence a(2)=4
%e n=3: q=5, m=7, p=17, (p-q)=10, (p-m)/q=2, hence a(3)=7.
%t Reap[Do[q=Prime[n];m=1;p=2;While[Mod[Prime[m]-m,q]>0,m++];Sow[m],{n,100}]][[2,1]]
%K nonn
%O 1,1
%A _Zak Seidov_, Aug 10 2012
|
