login
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
OFFSET
1,1
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
KEYWORD
nonn
AUTHOR
Zak Seidov, Oct 28 2014
STATUS
approved