10790325

Appears in sequences

• Numbers k such that phi(5k-1) = sigma(k).at n=27A067224
• a(n) is the least integer that can be expressed as the difference of two n-gonal numbers in exactly n ways.at n=10A338105
• Numbers k such that k * gcd(sigma(k), A003961(k)) is equal to the odd part of {sigma(k) * gcd(k, A003961(k))}, where A003961 shifts the prime factorization one step towards larger primes, and sigma is the sum of divisors function.at n=13A349169