OFFSET
1,1
COMMENTS
Conjecture: every prime eventually appears in the sequence.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
a(4) = 5 because 5 is a prime that has not yet occurred in the sequence, a(4) + 5 = 12 = 2^2^3 is a triprime; the only other prime (3) that has not yet occurred does not work because a(4) + 3 = 10 = 2*5 is not a triprime.
MAPLE
R:= 2: p:= 2: P:= select(isprime, [seq(i, i=3..10000, 2)]):
do
found:= false;
for k from 1 to nops(P) do
q:= P[k];
if numtheory:-bigomega(q+p) = 3 then
found:= true; p:= q; R:= R, p; P:= subsop(k=NULL, P); break
fi
od;
if not found then break fi;
od:
R;
CROSSREFS
KEYWORD
nonn
AUTHOR
Zak Seidov and Robert Israel, Mar 04 2023
STATUS
approved