Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #14 Nov 24 2024 10:08:32
%S 3,5,13,31,71,131,227,353,577,883,1283,1789,2389,3169,4093,5113,6329,
%T 7723,9343,11243,13523,15959,18731,21767,25031,28631,32479,36529,
%U 40841,45481,50341,55487,61631,68099,74831,81901,89317,98123,107243,116681,126601,137507
%N Lexicographically earliest infinite sequence of distinct primes such that, for n > 0, 2n | (a(n+1) - a(n)) and, for n > 0, b(n+1) > b(n) where b(n) = (a(n+1) - a(n)) / 2n.
%o (PARI) my(p=3, q=1); print1(p); forstep(k=2,200,2, while(!isprime(p+q*k), q++); p+=q*k; print1(", ",p); q++);
%K nonn
%O 1,1
%A _Mikhail Kurkov_, Dec 28 2021