|
%I #22 May 23 2017 07:10:57
%S 1,1,1,1,1,7,1,1,1,11,1,7,1,15,16,1,1,7,1,11,22,23,1,7,1,27,1,15,1,62,
%T 1,1,34,35,36,7,1,39,40,11,1,84,1,23,16,47,1,7,1,11,52,27,1,7,56,15,
%U 58,59,1,62,1,63,22,1,66,128,1,35,70,130,1,7,1,75,16,39,78,150,1,11,1,83,1,84,86,87,88,23,1,62
%N Sum of nonprime squarefree divisors of n.
%H G. C. Greubel, <a href="/A284118/b284118.txt">Table of n, a(n) for n = 1..5000</a>
%H <a href="/index/Su#sums_of_divisors">Index entries for sequences related to sums of divisors</a>
%F G.f.: x/(1 - x) + Sum_{k>=2} sgn(omega(k)-1)*mu(k)^2*k*x^k/(1 - x^k), where omega(k) is the number of distinct primes dividing k (A001221) and mu(k) is the Moebius function (A008683).
%F a(n) = Sum_{d|n, d nonprime squarefree} d.
%F a(n) = 1 if n is a prime power.
%e a(30) = 62 because 30 has 8 divisors {1, 2, 3, 5, 6, 10, 15, 30} among which 5 are nonprime squarefree {1, 6, 10, 15, 30} therefore 1 + 6 + 10 + 15 + 30 = 62.
%t nmax = 90; Rest[CoefficientList[Series[x/(1 - x) + Sum[Sign[PrimeNu[k] - 1] MoebiusMu[k]^2 k x^k/(1 - x^k), {k, 2, nmax}], {x, 0, nmax}], x]]
%t Table[Total[Select[Divisors[n], #1 == 1 || (SquareFreeQ[#1] && PrimeNu[#1] > 1) &]], {n, 90}]
%o (PARI) Vec((x/(1 - x)) + sum(k=2, 90, sign(omega(k) - 1) * moebius(k)^2 * k * x^k/(1 - x^k)) + O(x^91)) \\ _Indranil Ghosh_, Mar 21 2017
%o (Python)
%o from sympy import divisors
%o from sympy.ntheory.factor_ import core
%o def a(n): return sum([i for i in divisors(n) if core(i)==i and isprime(i)==0]) # _Indranil Ghosh_, Mar 21 2017
%Y Cf. A000469, A001221, A008683, A048250, A259936.
%K nonn
%O 1,6
%A _Ilya Gutkovskiy_, Mar 20 2017
|
