This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A065314 Smallest prime divisor of (n-th primorial - (n+1)-st prime). 5

%I

%S 23,199,2297,30013,41,9699667,2819,53,21701,79,163,181,61,1619,14669,

%T 307,103,306091,907,3217644767340672907899084554047,

%U 267064515689275851355624017992701,23768741896345550770650537601358213

%N Smallest prime divisor of (n-th primorial - (n+1)-st prime).

%H Michel Marcus, <a href="/A065314/b065314.txt">Table of n, a(n) for n = 3..40</a>

%H R. Mestrovic, <a href="http://arxiv.org/abs/1202.3670">Euclid's theorem on the infinitude of primes: a historical survey of its proofs (300 BC--2012) and another new proof</a>, arXiv preprint arXiv:1202.3670 [math.HO], 2012. - _N. J. A. Sloane_, Jun 13 2012

%F a(n) = A020639( A002110(n) - A000040(n+1) ).

%e n=3, 3rd primorial=30, p(4)=7, difference=23, a(3)=23.

%t Map[FactorInteger[Times @@ #1 - #2][[1, 1, 1]] & @@ Reverse@ TakeDrop[#, -1] &, Drop[#, 3] &@ FoldList[Flatten@ Append[{#1}, #2] &, Prime@ Range@ 25]] (* _Michael De Vlieger_, Jul 16 2017 *)

%o (PARI) a(n) = vecmin(factor(prod(k=1, n, prime(k)) - prime(n+1))[,1]); \\ _Michel Marcus_, Jul 16 2017

%Y Cf. A002110, A000040, A006530, A006530, A057713, A002584, A002585, A051342 A065314-A065317.

%K nonn

%O 3,1

%A _Labos Elemer_, Oct 29 2001

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 24 03:37 EDT 2019. Contains 325290 sequences. (Running on oeis4.)