OFFSET
1,1
COMMENTS
Every Pythagorean prime p can be uniquely written as the sum of two positive integers a and b such that ab is congruent to 1 (mod p). If a>b, then the difference a-b must be an odd number; no number on this list can be said difference, and every positive odd integer NOT on this list is the difference of exactly one pair.
EXAMPLE
Examples: 5 is not on this list, and 17-12=5 while 17+12=29 and (17)(12)==1 mod 29. 9 is not on this list, and 13-4=9 while 13+4=17 and (13)(4)==1 mod 17. 13 is not on this list, and 93-80=13 while 93+80=173 and (93)(80)==1 mod 173. Note that 5^2+4=29, 9^2+4=85=17(5), and 13^2+4=173
MATHEMATICA
fQ[n_] := FactorInteger[n^2 + 4][[-1, 1]] < n; Select[2 Range[380] - 1, fQ] (* Robert G. Wilson v, Feb 17 2017 *)
PROG
(PARI) isok(n) = (n%2) && vecmax(factor(n^2+4)[, 1]) < n; \\ Michel Marcus, Feb 18 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Michael Kaltman, Feb 17 2017
EXTENSIONS
a(22) onward from Robert G. Wilson v, Feb 17 2017
STATUS
approved