|
%I #18 Jun 21 2022 05:09:07
%S 0,0,0,0,0,0,2401,0,0,0,0,0,28561,2401,0,0,0,0,130321,0,2401,0,0,0,0,
%T 28561,0,2401,0,0,923521,0,0,0,2401,0,1874161,130321,28561,0,0,2401,
%U 3418801,0,0,0,0,0,2401,0,0,28561,0,0,0,2401,130321,0,0,0,13845841,923521,2401,0,28561,0,20151121,0,0,2401,0,0,28398241,1874161
%N Sum of 4th powers of primes = 1 mod 3 dividing n.
%H Antti Karttunen, <a href="/A005073/b005073.txt">Table of n, a(n) for n = 1..10001</a>
%F Additive with a(p^e) = p^4 if p = 1 (mod 3), 0 otherwise.
%t f[p_, e_] := If[Mod[p, 3] == 1, p^4, 0]; a[n_] := Plus @@ f @@@ FactorInteger[n]; a[1] = 0; Array[a, 100] (* _Amiram Eldar_, Jun 21 2022 *)
%o (Scheme) (define (A005073 n) (if (= 1 n) 0 (+ (A000583 (if (= 1 (modulo (A020639 n) 3)) (A020639 n) 0)) (A005073 (A028234 n))))) ;; _Antti Karttunen_, Jul 09 2017
%o (PARI) a(n) = my(f=factor(n)); sum(k=1, #f~, if (((p=f[k,1])%3) == 1, p^4)); \\ _Michel Marcus_, Jul 10 2017
%Y Cf. A000583, A005070, A005071, A005072.
%K nonn
%O 1,7
%A _N. J. A. Sloane_
%E More terms from _Antti Karttunen_, Jul 09 2017
|
