login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A073108
Least k such that there are n primes among the numbers n^2 + x^2 for 1 <= x <= k.
0
1, 3, 10, 11, 16, 29, 38, 35, 64, 29, 54, 107, 58, 69, 92, 85, 82, 163, 124, 81, 190, 155, 142, 241, 116, 139, 338, 213, 176, 221, 214, 223, 520, 211, 184, 361, 278, 267, 400, 179, 294, 607, 288, 335, 362, 379, 342, 587, 394, 261
OFFSET
1,2
PROG
(PARI) a(n)=if(n<0, 0, s=1; while(sum(k=1, s, isprime(k^2+n^2))<n, s++); s)
CROSSREFS
Sequence in context: A357708 A169939 A357627 * A352776 A255160 A344892
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Aug 19 2002
STATUS
approved