OFFSET
1,1
COMMENTS
Another version of A057948.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
From Michael De Vlieger, Aug 19 2017: (Start)
5 is in the sequence because it is prime.
9 is in the sequence because the only distinct prime divisor 3 is 3 (mod 4).
25 and 45 are not in the sequence because they are divisible by 5 = 1 (mod 4).
(End)
MAPLE
filter:= n -> isprime(n) or andmap(t -> t mod 4 <> 1, numtheory:-factorset(n)):
select(filter, [seq(i, i=5..1000, 4)]); # Robert Israel, Aug 21 2017
MATHEMATICA
Select[4 Range[80] + 1, Function[n, If[CompositeQ@ n, NoneTrue[ Select[ FactorInteger[n][[All, 1]], Mod[#, 4] == 1 &], Divisible[n, #] &], True]]] (* Michael De Vlieger, Aug 19 2017 *)
PROG
(Magma) lst:=[]; for n in [5..317 by 4] do if IsPrime(n) then Append(~lst, n); else f:=Factorization(n); if IsZero([x: x in [1..#f] | f[x][1] mod 4 eq 1]) then Append(~lst, n); end if; end if; end for; lst;
CROSSREFS
KEYWORD
nonn
AUTHOR
Arkadiusz Wesolowski, Aug 19 2017
STATUS
approved