A175432 a(n) = the greatest number k such that sigma(n) = m^k for any m >= 1 (sigma = A000203).
1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 7, 2, 1, 1, 1, 1, 1, 1
Offset: 1
Keywords
Examples
For n = 7, a(7) = 3 because sigma(7) = 8 = 2^3.
Links
- Antti Karttunen, Table of n, a(n) for n = 1..16384
Programs
-
Mathematica
Array[Apply[GCD, FactorInteger[DivisorSigma[1, #]][[All, -1]]] &, 105] (* Michael De Vlieger, Nov 05 2017 *)
-
PARI
a(n)=max(ispower(sigma(n)),1) \\ Charles R Greathouse IV, Feb 14 2013
Comments