A368541 The number of exponential divisors of the nonsquarefree numbers.
2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 4, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 2, 4, 2, 4, 2, 2, 3, 3, 2, 2, 2, 2, 2, 2, 2, 4, 2, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 6, 2, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 3, 4, 2, 2, 2, 4, 4, 2, 4, 2, 2, 3, 2, 4, 2, 2, 4, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 2, 4, 4, 2, 2, 2, 2, 2, 3, 2, 2, 2, 2, 2, 4, 2, 2, 2, 2, 2, 4, 3
Offset: 1
Keywords
Links
- Amiram Eldar, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
Mathematica
f[p_, e_] := DivisorSigma[0, e]; s[n_] := Times @@ f @@@ FactorInteger[n]; Select[Array[s, 200], # > 1 &]
-
PARI
lista(kmax) = {my(p, f); for(k = 1, kmax, f = factor(k); p = prod(i=1, #f~, numdiv(f[i, 2])); if(p > 1, print1(p, ", ")));}
Comments