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!)
A065315 Smallest prime divisor of n-th primorial + (n+1)-st prime. 3
5, 11, 37, 13, 23, 30047, 510529, 9699713, 127, 107, 433, 1093, 375569, 13082761331670077, 941879, 32589158477190044789, 1922760350154212639131, 4129, 92388407, 5879, 40729680599249024150621323549, 1783, 4903, 10279098043, 191, 131, 109, 163, 337, 20261, 673327, 6599, 181 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
R. Mestrovic, Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof, arXiv preprint arXiv:1202.3670, 2012 - From N. J. A. Sloane, Jun 13 2012
FORMULA
a(n) = A020639(A002110(n)+A000040(n+1)).
a(n) = A020639(A060881(n)). - Michel Marcus, Sep 08 2023
EXAMPLE
n=3, 3rd primorial=30, prime(4)=7,sum=37, a(3)=37.
PROG
(PARI) a(n) = vecmin(factor(prod(i=1, n, prime(i)) + prime(n+1))[, 1]); \\ Michel Marcus, Aug 29 2019
CROSSREFS
Sequence in context: A188161 A323352 A005178 * A065317 A171268 A152563
KEYWORD
nonn
AUTHOR
Labos Elemer, Oct 29 2001
EXTENSIONS
More terms from Michel Marcus, Aug 29 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 June 8 09:36 EDT 2024. Contains 373217 sequences. (Running on oeis4.)