[math-fun] Number theory question

Can one show that there are infinitely many $n$ divisible by neither 41 or 42 such that n^2-n+41 (Euler's famous prime-generating polynomial) is composite? Jim Propp