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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A187562 Least k >= 0 such that prime(n)*(prime(n)-k)+1 is prime. 1
 0, 1, 3, 1, 3, 1, 3, 7, 3, 11, 9, 3, 3, 3, 3, 9, 5, 3, 1, 11, 9, 1, 9, 5, 7, 5, 3, 9, 7, 11, 3, 21, 23, 1, 11, 1, 3, 1, 9, 3, 5, 15, 5, 1, 3, 9, 3, 13, 3, 7, 3, 5, 13, 21, 9, 21, 9, 21, 21, 5, 3, 21, 3, 3, 9, 11, 15, 1, 11, 1, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Pierre CAMI, Table of n, a(n) for n = 1..25000 MAPLE A187562 := proc(n) local p, k; p := ithprime(n) ; for k from 0 do if isprime( p*(p-k)+1 ) then return k; end if; end do: end proc: # R. J. Mathar, Mar 13 2011 MATHEMATICA Table[k = 0; While[! PrimeQ[Prime[n]*(Prime[n] - k) + 1], k++]; k, {n, 100}] CROSSREFS Sequence in context: A332031 A023511 A035628 * A370719 A057024 A023892 Adjacent sequences: A187559 A187560 A187561 * A187563 A187564 A187565 KEYWORD nonn AUTHOR Pierre CAMI, Mar 13 2011 STATUS approved

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.

Last modified August 9 16:51 EDT 2024. Contains 375044 sequences. (Running on oeis4.)