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”).

A176983
Primes p such that smallest prime q > p^2 is of form q = p^2 + k^2.
5
2, 5, 7, 13, 17, 37, 47, 67, 73, 97, 103, 137, 163, 167, 193, 233, 277, 281, 293, 307, 313, 317, 347, 373, 389, 421, 439, 461, 463, 487, 499, 503, 547, 571, 577, 593, 607, 613, 661, 677, 691, 701, 739, 743, 769, 787, 821, 823, 827, 829, 853, 883, 953, 967, 983
OFFSET
1,1
COMMENTS
By Fermat's 4n+1 theorem, q must be congruent to 1 (mod 4).
Corresponding values of k: 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 2, 4, 4, 4, 6, 2, 2, 4, 2. - Zak Seidov, Nov 04 2013
EXAMPLE
17 is here because 293 is the first prime after 17^2 and 293 = 17^2 + 2^2.
MATHEMATICA
Select[Prime[Range[200]], IntegerQ[Sqrt[NextPrime[ #^2] - #^2]] & ]
CROSSREFS
A062324 is subsequence. - Zak Seidov, Nov 04 2013
Sequence in context: A260388 A169586 A023229 * A160676 A169690 A144300
KEYWORD
nonn
AUTHOR
Ulrich Krug (leuchtfeuer37(AT)gmx.de), Apr 30 2010
EXTENSIONS
Edited and extended by T. D. Noe, May 12 2010
STATUS
approved