The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A143393 a(n) is the least prime p such that p*(p+prime(n))-1 is prime with prime(i)=i-th prime. 2
2, 3, 2, 2, 3, 2, 2, 2, 5, 2, 3, 7, 3, 2, 2, 2, 7, 3, 2, 5, 2, 5, 3, 2, 2, 3, 3, 7, 5, 2, 2, 3, 2, 2, 5, 3, 2, 5, 2, 2, 5, 5, 11, 2, 2, 2, 3, 2, 2, 2, 11, 7, 5, 3, 7, 3, 2, 3, 2, 5, 2, 3, 2, 3, 3, 5, 11, 2, 3, 2, 2, 29, 3, 5, 2, 2, 37, 2, 5, 2, 11, 5, 3, 3, 2, 5, 5, 5, 23, 2, 2, 17, 2, 3, 7, 2, 2, 3, 2, 5, 2, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
2*(2+2)-1=7 prime so a(1)=2 as prime(1)=2;
2*(2+3)-1=9 composite; 3*(3+3)-1=17 prime so a(2)=3 as prime(2)=3.
PROG
(PARI) a(n) = {my(pn=prime(n), p=2); while (!isprime(p*(p+pn)-1), p = nextprime(p+1)); p; } \\ Michel Marcus, Sep 24 2019
CROSSREFS
Cf. A143394.
Sequence in context: A128049 A104543 A054988 * A269111 A166497 A116909
KEYWORD
nonn
AUTHOR
Pierre CAMI, Aug 12 2008
EXTENSIONS
Name edited by Michel Marcus, Sep 24 2019
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 May 14 03:35 EDT 2024. Contains 372528 sequences. (Running on oeis4.)