OFFSET
4,2
LINKS
Hugo Pfoertner, Table of n, a(n) for n = 4..10000
PROG
(PARI) for(n=4, 89, my(n2=n*n); forstep(k=n2, 1, -1, if(k%2==1&&omega(k)==2&&bigomega(k)==2, print1(n2-k, ", "); break))) \\ Hugo Pfoertner, Dec 06 2021
(Python)
from itertools import count
from sympy import factorint
def A349809(n):
for i in count(n**2-(n%2)-1, -2):
fs = factorint(i)
if len(fs) == 2 == sum(fs.values()):
return n**2-i # Chai Wah Wu, Dec 06 2021
CROSSREFS
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 06 2021
STATUS
approved