login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A364456
Lexicographically earliest sequence of distinct primes such that a(1)*a(2)*...*a(n-1) - a(n) is prime for n>=1 with a(1)=5.
0
5, 2, 3, 7, 11, 13, 17, 29, 23, 31, 37, 73, 41, 19, 59, 89, 83, 43, 47, 71, 79, 151, 137, 67, 181, 163, 167, 101, 103, 97, 53, 223, 61, 227, 229, 113, 109, 191, 127, 157, 389, 349, 199, 337, 463, 577, 193, 149, 991, 107, 139, 233, 131, 691, 173, 557, 307, 461, 313, 619, 353, 281, 487, 947, 641, 283, 673, 271, 433, 263
OFFSET
1,1
COMMENTS
Conjecture: This sequence contains all primes.
Conjecture: If f(n) = a(1)*a(2)*...*a(n-1) then f(n)-a(n) is the previous prime of f(n) - 1 for n > 1.
EXAMPLE
a(4) = 7 because 7 is the least prime not already in the sequence such that 5*2*3 - 7 = 30 - 7 = 23 which is prime.
MATHEMATICA
a[1]=5; a[n_]:=a[n]=(k=2; While[MemberQ[s=Array[a, n-1], k]||!PrimeQ[Times@@s-k], k=NextPrime@k]; k); Array[a, 70]
CROSSREFS
Sequence in context: A131567 A200301 A114746 * A353617 A133746 A374957
KEYWORD
nonn
AUTHOR
STATUS
approved