Smallest integer m such that gcd{x | sum of proper divisors of x is m} is equal to 2*n, when there are at least two such x's.

A253303

Smallest integer m such that gcd{x | sum of proper divisors of x is m} is equal to 2*n, when there are at least two such x's.

Terms

    a(0) =16a(1) =136a(2) =186a(3) =1352a(4) =1340a(5) =1356a(6) =1414a(7) =1276a(8) =1026a(9) =15640a(10) =6742a(11) =1968a(12) =35786a(13) =924a(14) =11076a(15) =11812a(16) =61714a(17) =14556a(18) =76862a(19) =6440a(20) =12774a(21) =70444a(22) =62446a(23) =16080a(24) =24904a(25) =16152a(26) =27900a(27) =65464a(28) =36026a(29) =41100

External references