This site is supported by donations to The OEIS Foundation.

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A175067 a(n) = sum of perfect divisors of n. Perfect divisor of n is divisor d such that d^k = n for some k >= 1. 6
 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, 26, 30, 28, 29, 30, 31, 34, 33, 34, 35, 42, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 56, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 78, 65, 66, 67, 68, 69, 70, 71, 72 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n) > n for perfect powers n = A001597(m) for m > 2. LINKS Ivan Neretin, Table of n, a(n) for n = 1..10000 FORMULA a(n) = A175070(n) + n. [Jaroslav Krizek, Jan 24 2010] EXAMPLE For n = 8: a(8) = 10; there are two perfect divisors of 8: 2 and 8; their sum is 10. MATHEMATICA Table[Plus @@ (n^(1/Divisors[GCD @@ FactorInteger[n][[All, 2]]])), {n, 72}] (* Ivan Neretin, May 13 2015 *) CROSSREFS Sequence in context: A093783 A096861 A118738 * A051377 A057723 A142151 Adjacent sequences:  A175064 A175065 A175066 * A175068 A175069 A175070 KEYWORD nonn AUTHOR Jaroslav Krizek, Jan 23 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.