login

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”).

A087201
a(n) is the smallest m such that m > A055211(n) and A002110(n)-m is prime.
1
11, 13, 17, 19, 47, 37, 61, 67, 79, 107, 53, 149, 97, 89, 109, 223, 107, 179, 181, 101, 197, 101, 257, 139, 137, 197, 313, 257, 257, 223, 449, 373, 233, 463, 479, 409, 257, 409, 383, 317, 587, 607, 401, 463, 347, 313, 751, 313, 443, 349, 809, 661, 587, 367
OFFSET
3,1
COMMENTS
a(1) and a(2) are not defined. a(n) is the second m (first m is A055211(n)) such that m > 1 and A002110(n)-m is prime. I guess every term of this sequence (compare the conjecture about A055211) is prime. I checked this conjecture for n < 418.
FORMULA
A055211[n_] := (For[m=2, !PrimeQ[Product[Prime[k], {k, n}]-m], m++ ]; m); a[n_] := (For[m=A055211[n]+1, !PrimeQ[Product[Prime[k], {k, n}]-m], m++ ]; m);
MATHEMATICA
A055211[n_] := (For[m=2, !PrimeQ[Product[Prime[k], {k, n}]-m], m++ ]; m); a[n_] := (For[m=A055211[n]+1, !PrimeQ[Product[Prime[k], {k, n}]-m], m++ ]; m); Table[a[n], {n, 3, 62}]
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Farideh Firoozbakht, Aug 27 2003
STATUS
approved