|
| |
|
|
A145016
|
|
Primes p of the form 4k+1 for which p-(floor(sqrt(p)))^2 is a full square
|
|
14
| |
|
|
5, 13, 17, 29, 37, 53, 73, 97, 101, 109, 137, 173, 197, 229, 241, 257, 281, 293, 349, 397, 401, 409, 457, 509, 577, 601, 641, 661, 677, 701, 733, 809, 857, 877, 977, 997, 1033, 1049, 1093, 1153, 1181, 1229, 1289, 1297, 1321, 1373, 1433, 1453, 1493, 1601, 1609
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| If a(n)=x^2+y^2 then y=floor(sqrt(a(n))) and by well known Euler theorem, it is the unique such representation
|
|
|
MATHEMATICA
| okQ[n_]:=PrimeQ[n]&&IntegerQ[Sqrt[n-Floor[Sqrt[n]]^2]]; Select[4Range[500]+1, okQ] (* From Harvey P. Dale, Mar 23 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A002144 A192592 A111055 * A123079 A038938 A184851
Adjacent sequences: A145013 A145014 A145015 * A145017 A145018 A145019
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Vladimir Shevelev (shevelev(AT)bgu.ac.il), Sep 29 2008
|
| |
|
|
