OFFSET
0,1
COMMENTS
Suggested in an email by J. M. Bergot.
For n >= 1, a(n) has the form k * 5^n + x, for some k >= 0, where x is a solution to the modular quadratic equation x^2 + (d+2)*x + d == 0 (mod 5^n), where d = q-p. - Daniel Suteu, Dec 28 2022
EXAMPLE
a(2) = 1847 because 1847 is prime, the next prime is 1861, 1847*1861 + 1847 + 1861 = 3440975 = 5^2 * 137639 where 137639 is prime, and no smaller prime works.
MAPLE
V:= Array(0..8):
q:= 2: count:= 0:
while count < 9 do
p:= q; q:= nextprime(q);
t:= p*q+p+q;
k:= padic:-ordp(t, 5);
if V[k] = 0 and isprime(t/5^k) then
V[k]:= p; count:= count+1
fi
od:
convert(V, list);
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert Israel, Dec 25 2022
EXTENSIONS
a(11) from Michael S. Branicky, Dec 26 2022
a(12)-a(15) from David A. Corneth, Dec 26 2022
a(16) from Martin Ehrenstein, Dec 27 2022
a(17)-a(21) from Daniel Suteu, Dec 28 2022
STATUS
approved