login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A089884 a(n) = Max(Min(k: m+prime(n)*k is prime): 1<=m<prime(n)). 0

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 8 04:18 EDT 2024. Contains 372317 sequences. (Running on oeis4.)