cp's OEIS Frontend

A204910 Least prime p such that n divides p-q for some prime q satisfying 5<=q

%I A204910 #10 Jun 27 2019 12:13:06
%S A204910 7,7,11,11,17,11,19,13,23,17,29,17,31,19,37,23,41,23,43,31,47,29,53,
%T A204910 29,61,31,59,41,71,37,67,37,71,41,83,41,79,43,83,47,89,47,97,61,97,53,
%U A204910 101,53,103,61,107,59,113,59,127,61,127,71,131,67,127,67,131,71,137,71,139,73,149,83,149,79
%N A204910 Least prime p such that n divides p-q for some prime q satisfying 5<=q<p.
%C A204910 For a guide to related sequences, see A204892.
%H A204910 Robert Israel, <a href="/A204910/b204910.txt">Table of n, a(n) for n = 1..10000</a>
%p A204910 f:= proc(n) local p,k;
%p A204910   p:= n+4;
%p A204910   do
%p A204910     p:= nextprime(p);
%p A204910     if ormap(isprime, [seq(p-n*k,k=1..(p-5)/n)]) then return p fi
%p A204910   od
%p A204910 end proc:
%p A204910 map(f, [$1..100]); # _Robert Israel_, Jun 27 2019
%t A204910 (See the program at A204908.)
%Y A204910 Cf. A204908, A204900, A204892.
%K A204910 nonn,look
%O A204910 1,1
%A A204910 _Clark Kimberling_, Jan 20 2012
%E A204910 More terms from _Robert Israel_, Jun 27 2019