4626930domain: NAppears in sequencesSmallest number m such that m = p(i) mod p(i)^2 for 1<=i<=n.at n=4A071056Numbers k such that phi(phi(k))/k < phi(phi(m))/m for all m < k, where phi is Euler's totient function (A000010).at n=27A293714