OFFSET
1,1
COMMENTS
There is a conjecture about an upper bound on this sequence. Let p_n be the n-th prime. If a(n) < p_n^2 - p_n holds for n>=3 then Goldbach's conjecture and the twin prime conjecture hold as well.
LINKS
Mario Ziller, John F. Morack, Divisibility in paired progressions, Goldbach's conjecture, and the infinitude of prime pairs, arXiv:1706.00317 [math.NT], 2017.
Mario Ziller, John F. Morack, On the computation of the generalised Jacobsthal function for paired progressions, arXiv:1706.03668 [math.NT], 2017.
FORMULA
a(n) = 6*A072753(n) + 6, for n>=3.
CROSSREFS
KEYWORD
hard,more,nonn
AUTHOR
Mario Ziller, Jun 17 2017
STATUS
approved