OFFSET
1,1
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
MAPLE
filter:= proc(n) local F, p, q;
F:= ifactors(n)[2];
if nops(F) <> 2 or F[1, 2] <> 1 or F[2, 2] <> 1 then return false fi;
p:= F[1, 1]; q:= F[2, 1];
numtheory:-issqrfree((p+q)/2) and numtheory:-issqrfree(abs(p-q)/2)
end proc:
select(filter, [seq(i, i=1..1000, 2)]); # Robert Israel, Dec 12 2023
MATHEMATICA
okQ[n_] := MatchQ[FactorInteger[n], {{p_, 1}, {q_, 1}} /; SquareFreeQ[(p + q)/2] && SquareFreeQ[(q - p)/2]];
Select[Range[1, 1000, 2], okQ] (* Jean-François Alcover, Jun 04 2024 *)
PROG
(PARI) forstep (k = 15, 900, 2, if (omega(k)==2 && bigomega(k)==2, my (F=factorint(k)); if ( issquarefree((F[2, 1]-F[1, 1])/2) && issquarefree((F[2, 1]+F[1, 1])/2), print1(k, ", "))))
CROSSREFS
KEYWORD
nonn
AUTHOR
Hugo Pfoertner, Jul 01 2023
STATUS
approved