356080725

Appears in sequences

• 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=25A349169
• a(n) are the denominators corresponding to A372422(n).at n=13A372423