1,2

a(n) > n for perfect powers n = A001597(m) for m > 2.

Ivan Neretin, Table of n, a(n) for n = 1..10000

a(n) = A175070(n) + n. [Jaroslav Krizek, Jan 24 2010]

For n = 8: a(8) = 10; there are two perfect divisors of 8: 2 and 8; their sum is 10.

Table[Plus @@ (n^(1/Divisors[GCD @@ FactorInteger[n][[All, 2]]])), {n, 72}] (* Ivan Neretin, May 13 2015 *)

Sequence in context: A093783 A096861 A118738 * A051377 A057723 A142151

Adjacent sequences: A175064 A175065 A175066 * A175068 A175069 A175070

nonn

Jaroslav Krizek, Jan 23 2010

approved