Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Mar 30 2012 18:50:42
%S 1,2,3,4,6,7,6,10,10,10,18,11,14,10,20,12,12,24,15,18,24,16,20,22,15,
%T 21,19,22,21,19,29,23,28,34,23,29,22,27,23,27,30,26,25,36,28,24,30,21,
%U 28,40,25,40,24,27,24,34,29,27,28,29,46,29,38,34,37,38,31,51,39,46,37
%N a(n) = Max(Min(k: m+prime(n)*k is prime): 1<=m<prime(n)).
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/DirichletsTheorem.html">Dirichlet's Theorem</a>
%H <a href="/index/Pri#primes_AP">Index entries for sequences related to primes in arithmetic progressions</a>
%e n=4, prime(4)=7, a(4)=4 as: 1->8->15->22->29, 2->9->16->23,
%e 3->10->17, 4->11, 5->12->19, 6->13.
%K nonn
%O 1,2
%A _Reinhard Zumkeller_, Jan 10 2004