127357230domain: NAppears in sequencesSmallest number m such that m = p(i) mod p(i)^2 for 1<=i<=n.at n=5A071056a(n) is the smallest squarefree number m with n prime factors such that Sum_{prime q|m} 1/q - 1/m = P/Q, where P <> Q are primes, for n > 1, or a(n) = 1 if no such m.at n=6A309378