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!)
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 (list; graph; refs; listen; history; text; internal format)
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.
LINKS
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
Sequence in context: A157175 A132244 A262731 * A068492 A206287 A306661
KEYWORD
easy,nonn
AUTHOR
Farideh Firoozbakht, Aug 27 2003
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)