(PARI) allpwrfact(n, p) = /* All prime factors are raised to the power p */ { local(x, j, ln, y, flag); for(x=4, n, y=Vec(factor(x)); ln = length(y[1]); flag=0; for(j=1, ln, if(y[2][j]==p, flag++); ); if(flag==ln, print1(x", ")); ) }
(Python)
from math import isqrt
from sympy import mobius
def f(x): return int(n+1-sum(mobius(k)*(x//k**2) for k in range(2, isqrt(x)+1)))
m, k = n, f(n)
while m != k: m, k = k, f(k)