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!)
A224894 a(1) = 1, a(n+1) = smallest prime divisor of 1 + product of all the primes p <= a(n). 0
1, 2, 3, 7, 211, 1051, 91943, 206705778299 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Following Euclid's proof that there are infinitely many primes.
For example, 211 is 2*3*5*7 + 1 and 1051 is the smallest prime divisor of 2*3*5*...*211 + 1. This differs from the Euclid-Mullin sequence (A000945) because all the primes between a(n-1) and a(n) are used in calculating a(n+1).
LINKS
EXAMPLE
a(5) = 2*3*5*7 + 1 = 211.
a(6) = 1051 because 1051 is the smallest prime divisor of 2*3*5*...*211 + 1.
MATHEMATICA
a[1] = 1; a[n_] := a[n] = Block[{pr = 1 + Product[Prime[k], {k, PrimePi@a[n - 1]}], p = NextPrime@a[n - 1]}, While[Mod[pr, p] > 0, p = NextPrime@p]; p]; Array[a, 7] (* Giovanni Resta, Jul 24 2013 *)
CROSSREFS
Sequence in context: A087311 A053924 A130060 * A266269 A053942 A053954
KEYWORD
nonn,hard
AUTHOR
Antonio Sanso, Jul 24 2013
EXTENSIONS
a(8) from Giovanni Resta, Jul 25 2013
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 March 3 04:18 EST 2024. Contains 370499 sequences. (Running on oeis4.)