40588485

Appears in sequences

• Positive integers n such that phi(n) - d(n) = phi(n+1) - d(n+1) where d(n) is the number of divisors of n.at n=23A063069
• Numbers n such that |phi(n+1)-phi(n)| = |d(n+1)-d(n)|, where phi is Euler's totient function and d(n) = number of divisors of n.at n=32A066219
• Numbers n such that tau(n) = tau(n+1) and phi(n) = phi(n+1).at n=17A217773
• Numbers k such that phi(k) = phi(k+1) and simultaneously Product_{d|k} phi(d) = Product_{d|(k+1)} phi(d) where phi(x) = Euler totient function (A000010).at n=8A247174
• Numbers k such that Product_{d|k} phi(d) = Product_{d|(k+1)} phi(d) where phi(x) = Euler totient function (A000010).at n=9A248795
• Numbers n such that phi(n) + d(n) = phi(n+1) + d(n+1), where phi(n) is the Euler totient function of n and d(n) the number of divisors of n.at n=26A259496
• Numbers k such that both k and k+1 are squarefree and phi(k) = phi(k+1), where phi is the Euler totient function (A000010).at n=23A333875