%I #24 May 03 2021 06:07:07

%S 2,3,5,7,7,11,11,13,17,17,19,23,23,29,29,31,31,37,37,37,41,43,47,53,

%T 53,53,59,59,59,67,67,71,71,79,79,79,83,89,89,97,97,97,97,101,101,107,

%U 113,127,127,127,127,127,127,131,137,137,137

%N a(n)=the prime q<prime(n) for which (prime(n) mod q) is maximal.

%H Ivan Neretin, <a href="/A039734/b039734.txt">Table of n, a(n) for n = 2..10000</a>

%t Table[Sort[Prime@Range@n, Mod[Prime[n], #1] > Mod[Prime[n], #2] &][[1]], {n, 2, 58}] (* _Ivan Neretin_, Feb 23 2018 *)

%o (PARI) a(n) = {theq = 0; modmax = 0; pr = prime(n); forprime(q = 2, pr-1, mq = pr % q; if (mq > modmax, modmax = mq; theq = q);); theq;} \\ _Michel Marcus_, Oct 02 2013

%Y Cf. A039733, A079953.

%K nonn

%O 2,1

%A _Clark Kimberling_