The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A067836 Let a(1)=2, f(n)=a(1)*a(2)*...*a(n-1) for n>=1 and a(n)=nextprime(f(n)+1)-f(n) for n>=2, where nextprime(x) is the smallest prime > x. 9
 2, 3, 5, 7, 13, 11, 17, 19, 23, 37, 73, 29, 31, 43, 79, 53, 83, 67, 41, 47, 179, 149, 181, 103, 71, 59, 197, 167, 109, 137, 107, 251, 101, 157, 199, 283, 211, 277, 173, 127, 269, 61, 89, 271, 151, 191, 227, 311, 409, 577, 331, 281, 313, 307, 223, 491, 439, 233, 367 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The terms are easily seen to be distinct. It is conjectured that every element is prime. Do all primes occur in the sequence? All elements are prime and distinct through n=1000. - Robert Price, Mar 09 2013 All elements are prime and distinct through n=3724. - Dana Jacobsen, Feb 15 2015 With a(0) = 1, a(n) is the next smallest number not in the sequence such that a(n) + Product_{i=1..n-1} a(i) is prime. - Derek Orr, Jun 16 2015 LINKS Robert Price and Dana Jacobsen, Table of n, a(n) for n = 1..3724 (first 1000 terms from Robert Price) Frank Buss, Prime Puzzles - Frank Buss's Conjecture Frank Buss, The B(n) function MATHEMATICA <

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 May 30 11:18 EDT 2020. Contains 334724 sequences. (Running on oeis4.)