Smallest integer m such that gcd{x | sum of proper divisors of x is m} is equal to n, when there are at least two such x's.
A253302
Smallest integer m such that gcd{x | sum of proper divisors of x is m} is equal to n, when there are at least two such x's.
Terms
- a(0) =1a(1) =16a(2) =300a(3) =136a(4) =50316a(5) =186a(6) =97748a(7) =1352a(8) =72318a(9) =1340a(10) =1652a(11) =1356
External references
- oeis: A253302