login
Smallest prime(k) such that prime(k)-prime(j) == 0 (mod prime(n)), for some k > j.
3

%I #7 Dec 05 2013 19:56:32

%S 5,5,7,17,13,29,19,41,53,31,67,79,43,89,97,109,61,127,137,73,149,163,

%T 173,181,197,103,211,109,223,229,257,269,139,281,151,307,317,331,337,

%U 349,181,367,193,389,199,401,433,449,229,461,479,241,487,509,521,557

%N Smallest prime(k) such that prime(k)-prime(j) == 0 (mod prime(n)), for some k > j.

%C If prime(m), prime(m+1) form a twin prime pair then a(m) = prime(m+1).

%e a(5) = 13 as 13-2 =11, a(8) = 41 as 41-3 = 38 = 2*19.

%o (PARI) r=Set();forprime(n=2,10^5,s=r;forprime(k=n,10^5,if(setsearch(s,k%n),print1(" ",k);break,s=setunion(s,[k%n])));r=setunion(r,[n])) (Alekseyev)

%Y Cf. A088046.

%K nonn

%O 1,1

%A _Amarnath Murthy_, Sep 20 2003

%E More terms from _Max Alekseyev_, Feb 14 2005