Positive spoof Lehmer factorizations

We investigate the integer solutions of Diophantine equations related to Lehmer’s totient conjecture. We give an algorithm that computes all nontrivial spoof Lehmer factorizations with a fixed number of factors, and enumerate all nontrivial spoof Lehmer factorizations with 6 or fewer factors.