OFFSET
1,1
COMMENTS
S. Fajtlowicz defined two related sequences of primes, p(n) and q(n), as follows:
1. q(1)=2 and p(1)=7.
2. q(n+1) is the smallest prime dividing p(n)+2.
3. p(n+1) is the smallest prime p larger than p(n) such that p+2 is not prime and not divisible by any of q(1),q(2),...,q(n+1).
Paul Erdős and C. Larson conjecture that all primes occur in the sequence of q's.
The values of p and q were computed by Bethany Turner.
REFERENCES
Siemion Fajtlowicz, Written on the Wall: Conjectures of Graffiti, #784 (1994).
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..500 (terms 1..218 from R. J. Mathar)
Siemion Fajtlowicz, Graffity & automated conjecture making (2009), click on "conjectures up to No. 894", see page 136.
MAPLE
A185956 := proc(n)
option remember;
if n = 1 then
2;
else
end if;
end proc:
seq(A185956(n), n=1..20) ; # R. J. Mathar, Jul 28 2019
MATHEMATICA
lpf[n_] := FactorInteger[n][[1, 1]]; q[1] = 2; p[1] = 7; q[n_] := q[n] = lpf[p[n - 1] + 2]; p[n_] := Module[{pn = NextPrime[p[n - 1]]}, While[PrimeQ[pn + 2] || AnyTrue[Array[q, n], Divisible[pn + 2, #] &], pn = NextPrime[pn]]; pn]; Array[q, 50] (* Amiram Eldar, Apr 23 2021 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Craig Eric Larson, Feb 07 2011
STATUS
approved