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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A249420 Least number m>1 such that m*prime(n)-2 is prime. 1
 2, 3, 3, 3, 3, 3, 5, 7, 3, 11, 9, 3, 9, 3, 3, 3, 5, 3, 3, 3, 7, 9, 11, 5, 7, 5, 3, 23, 7, 3, 3, 5, 3, 7, 5, 21, 7, 3, 3, 5, 9, 3, 3, 3, 5, 9, 3, 7, 29, 7, 5, 5, 15, 3, 3, 3, 11, 3, 3, 11, 7, 3, 3, 5, 3, 5, 3, 3, 3, 7, 11, 9, 9, 3, 15, 5, 9, 7, 3, 7, 9, 13, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Zak Seidov, Table of n, a(n) for n = 1..1000 FORMULA a(n) = (A249419(n)+2)/prime(n). MATHEMATICA lnm[n_]:=Module[{m=2, p=Prime[n]}, While[!PrimeQ[m*p-2], m++]; m]; Array[ lnm, 90] (* Harvey P. Dale, Oct 22 2019 *) PROG (PARI) a(n) = {m = 2; pn = prime(n); while (!isprime(m*pn-2), m++); m; } \\ Michel Marcus, Oct 29 2014 CROSSREFS Sequence in context: A284725 A055767 A029110 * A103959 A035375 A354143 Adjacent sequences: A249417 A249418 A249419 * A249421 A249422 A249423 KEYWORD nonn AUTHOR Zak Seidov, Oct 28 2014 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 5 15:44 EDT 2024. Contains 374950 sequences. (Running on oeis4.)