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

%I #5 Mar 31 2012 14:40:08

%S 11,13,17,19,47,37,61,67,79,107,53,149,97,89,109,223,107,179,181,101,

%T 197,101,257,139,137,197,313,257,257,223,449,373,233,463,479,409,257,

%U 409,383,317,587,607,401,463,347,313,751,313,443,349,809,661,587,367

%N a(n) is the smallest m such that m > A055211(n) and A002110(n)-m is prime.

%C 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.

%F 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);

%t 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}]

%Y Cf. A055211, A002110, A087200.

%K easy,nonn

%O 3,1

%A _Farideh Firoozbakht_, Aug 27 2003

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 August 9 14:37 EDT 2024. Contains 375042 sequences. (Running on oeis4.)