|
%I #13 Jun 13 2018 03:24:32
%S 1,2,3,6,5,6,7,10,12,10,11,12,13,14,15,22,17,18,19,20,21,22,23,24,30,
%T 26,30,28,29,30,31,34,33,34,35,42,37,38,39,40,41,42,43,44,45,46,47,48,
%U 56,50,51,52,53,54,55,56,57,58,59,60,61,62,63,78,65,66,67,68,69,70,71,72
%N a(n) is the sum of perfect divisors of n, where a perfect divisor of n is a divisor d such that d^k = n for some k >= 1.
%C a(n) > n for perfect powers n = A001597(m) for m > 2.
%H Ivan Neretin, <a href="/A175067/b175067.txt">Table of n, a(n) for n = 1..10000</a>
%F a(n) = A175070(n) + n. [_Jaroslav Krizek_, Jan 24 2010]
%e For n = 8: a(8) = 10; there are two perfect divisors of 8: 2 and 8; their sum is 10.
%t Table[Plus @@ (n^(1/Divisors[GCD @@ FactorInteger[n][[All, 2]]])), {n, 72}] (* _Ivan Neretin_, May 13 2015 *)
%K nonn
%O 1,2
%A _Jaroslav Krizek_, Jan 23 2010
%E Name edited by _Michel Marcus_, Jun 13 2018
|
