

A356847


Greedily choose a(n) to be the least prime p > a(n1) such that all sums a(i) + a(j)  1, 1 <= i < j, are also prime.


0



5, 7, 13, 67, 97, 9337, 28657, 516157, 2193637, 1725215287, 5858906527, 10845974467, 311697041437, 2748104242057, 478834469031547, 30509330585363257
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

It is not known if this sequence is infinite.


LINKS

Sequence inspired by (but not mentioned in) talk by Terence Tao, February 23 2023, in the Number Theory Web Seminar.


PROG

(Python)
from math import gcd
from itertools import count, islice
from sympy import isprime, nextprime
def agen(): # generator of terms
alst = [5]
while True:
yield alst[1]
p = nextprime(alst[1])
while any(not isprime(ai + p  1) for ai in alst):
p = nextprime(p)
alst.append(p)


CROSSREFS



KEYWORD

nonn,more


AUTHOR



EXTENSIONS



STATUS

approved



