cp's OEIS Frontend

A327669 Sum of divisors of n that have an odd number of distinct prime factors.

%I A327669 #8 Sep 27 2019 15:19:44
%S A327669 0,2,3,6,5,5,7,14,12,7,11,9,13,9,8,30,17,14,19,11,10,13,23,17,30,15,
%T A327669 39,13,29,40,31,62,14,19,12,18,37,21,16,19,41,54,43,17,17,25,47,33,56,
%U A327669 32,20,19,53,41,16,21,22,31,59,104,61,33,19,126,18,82,67,23,26,84
%N A327669 Sum of divisors of n that have an odd number of distinct prime factors.
%H A327669 Alois P. Heinz, <a href="/A327669/b327669.txt">Table of n, a(n) for n = 1..20000</a>
%F A327669 G.f.: Sum_{k>=1} A030230(k) * x^A030230(k) / (1 - x^A030230(k)).
%F A327669 L.g.f.: log(B(x)) = Sum_{n>=1} a(n) * x^n / n, where B(x) = g.f. of A285799.
%F A327669 a(n) = Sum_{d|n} d * A092248(d).
%F A327669 a(n) = A000203(n) - A327670(n).
%F A327669 a(p) = p, where p is prime.
%p A327669 with(numtheory):
%p A327669 a:= n-> add(`if`(nops(factorset(d))::odd, d, 0), d=divisors(n)):
%p A327669 seq(a(n), n=1..80);  # _Alois P. Heinz_, Sep 21 2019
%t A327669 a[n_] := DivisorSum[n, # &, OddQ[PrimeNu[#]] &]; Table[a[n], {n, 1, 70}]
%Y A327669 Cf. A000203, A030230, A049060, A092248, A285799, A318677, A327670.
%K A327669 nonn
%O A327669 1,2
%A A327669 _Ilya Gutkovskiy_, Sep 21 2019