%I #16 Oct 28 2014 19:01:33
%S 2,2,2,3,2,3,3,3,2,2,5,3,2,3,5,2,3,5,5,5,5,3,2,2,3,5,3,7,5,2,3,2,11,3,
%T 3,5,5,3,3,2,2,5,2,5,3,3,7,5,3,7,2,2,7,2,3,5,3,7,11,2,7,2,7,5,3,3,5,3,
%U 11,3,3,2,3,5,7,3,5,3,11,3,2,7,2,3
%N Smallest prime number R such that there is a prime number Q with floor(Q/R) = prime(n).
%C Prime numbers Q are in A248595.
%H Pierre CAMI, <a href="/A248596/b248596.txt">Table of n, a(n) for n = 1..10000</a>
%t a[n_] := For[p = Prime[n]; r = 2, True, r = NextPrime[r], For[q = NextPrime[r*p, -1], q <= (p + 1) r, q = NextPrime[q], If[Floor[q/r] == p, Return[r]]]]; Array[a, 100] (* _Jean-François Alcover_, Oct 26 2014 *)
%o See A248595 for Excel & Visual Basic program.
%Y Cf. A248595.
%K nonn
%O 1,1
%A _Pierre CAMI_, Oct 09 2014