OFFSET
1,1
COMMENTS
Equivalently: Let i, i+d, i+2d, ..., i+(n-1)d be an arithmetic progression of exactly n primes; choose the first one which minimizes the common difference d; then a(n) = i+(n-1)d.
The word "exactly" requires both i-d and i+n*d to be nonprime.
Without "exactly", we get A113872.
The primes in these arithmetic progressions need not be consecutive.
a(n) != 113872(n) for n = 4, 8, 9, 19 because in these particular cases A113872(n) + A033188(n) is prime.
a(8) = 2351 and a(9) = 5179, found by Michael S. Branicky come from A354376.
REFERENCES
Richard K. Guy, Unsolved Problems in Number Theory, 3rd Edition, Springer, 2004, Section A5, Arithmetic progressions of primes, pp. 25-28.
LINKS
J. K. Andersen, Primes in Arithmetic Progression Records.
Eric Weisstein's World of Mathematics, Prime Arithmetic Progression.
EXAMPLE
The first few corresponding arithmetic progressions are:
n = 1 and d = 0: (2);
n = 2 and d = 1: (2, 3);
n = 3 and d = 2: (3, 5, 7);
n = 4 and d = 6: (41, 47, 53, 59);
n = 5 and d = 6: (5, 11, 17, 23, 29);
n = 6 and d = 30: (7, 37, 67, 97, 127, 157);
n = 7 and d = 150: (7, 157, 307, 457, 607, 757, 907);
n = 8 and d = 210: (881, 1091,1301, 1511, 1721, 1931, 2141, 2351).
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Bernard Schott, Jun 05 2022
STATUS
approved