|
%I #22 Jun 21 2022 05:10:51
%S 0,2,0,2,5,2,0,2,0,7,11,2,0,2,5,2,17,2,0,7,0,13,23,2,5,2,0,2,29,7,0,2,
%T 11,19,5,2,0,2,0,7,41,2,0,13,5,25,47,2,0,7,17,2,53,2,16,2,0,31,59,7,0,
%U 2,0,2,5,13,0,19,23,7,71,2,0,2,5,2,11,2,0,7,0,43,83,2,22,2,29,13,89,7,0,25,0,49,5
%N Sum of primes = 2 mod 3 dividing n.
%H Antti Karttunen, <a href="/A005074/b005074.txt">Table of n, a(n) for n = 1..10000</a>
%F Additive with a(p^e) = p if p = 2 (mod 3), 0 otherwise.
%F a(n) = A008472(n) - A005070(n) - 3*A079978(n). - _Antti Karttunen_, Jul 10 2017
%t Array[DivisorSum[#, # &, And[PrimeQ@ #, Mod[#, 3] == 2] &] &, 95] (* _Michael De Vlieger_, Jul 11 2017 *)
%t f[p_, e_] := If[Mod[p, 3] == 2, p, 0]; a[n_] := Plus @@ f @@@ FactorInteger[n]; a[1] = 0; Array[a, 100] (* _Amiram Eldar_, Jun 21 2022 *)
%o (Scheme) (define (A005074 n) (if (= 1 n) 0 (+ (if (= 2 (modulo (A020639 n) 3)) (A020639 n) 0) (A005074 (A028234 n))))) ;; _Antti Karttunen_, Jul 10 2017
%o (PARI) a(n) = my(f=factor(n)); sum(k=1, #f~, if (((p=f[k,1])%3) == 2, p)); \\ _Michel Marcus_, Jul 11 2017
%Y Cf. A005070, A005075, A005076, A005077, A005090, A008472, A079978.
%K nonn
%O 1,2
%A _N. J. A. Sloane_
%E More terms from _Antti Karttunen_, Jul 10 2017
|
