cp's OEIS Frontend

A145022 Primes p of the form 4k+1 for which s=2 is the least positive integer such that sp-(floor(sqrt(sp)))^2 is a square.

%I A145022 #14 Jan 12 2020 23:45:43
%S A145022 41,61,89,113,149,157,181,193,233,269,277,313,317,337,389,421,433,557,
%T A145022 569,613,617,709,761,773,853,881,929,937,1013,1109,1117,1129,1201,
%U A145022 1213,1301,1409,1429,1553,1637,1741,1753,1861,1873,1901,1997,2113,2137,2153
%N A145022 Primes p of the form 4k+1 for which s=2 is the least positive integer such that sp-(floor(sqrt(sp)))^2 is a square.
%H A145022 Robert Israel, <a href="/A145022/b145022.txt">Table of n, a(n) for n = 1..10000</a>
%e A145022 a(1)=41 since p=41 is the least prime of the form 4k+1 for which p-(floor(sqrt(p)))^2 is not a square, but 2p-(floor(sqrt(2p)))^2 is a square (for p=41 it is 1).
%p A145022 filter:= proc(p)
%p A145022   if not isprime(p) then return false fi;
%p A145022   if issqr(p-floor(sqrt(p))^2) then return false fi;
%p A145022   issqr(2*p-floor(sqrt(2*p))^2)
%p A145022 end proc:
%p A145022 select(filter, [seq(p,p=1..10000,4)]); # _Robert Israel_, Dec 04 2018
%t A145022 sQ[n_] := IntegerQ[Sqrt[n - (Floor[Sqrt[n]])^2]]; aQ[n_] := Mod[n, 4] == 1 && PrimeQ[n] && !sQ[n] && sQ[2n]; Select[Range[2200], aQ] (* _Amiram Eldar_, Dec 04 2018 *)
%Y A145022 Cf. A145016.
%K A145022 nonn
%O A145022 1,1
%A A145022 _Vladimir Shevelev_, Sep 29 2008