|
|
A005079
|
|
Sum of squares of primes = 1 mod 4 dividing n.
|
|
7
|
|
|
0, 0, 0, 0, 25, 0, 0, 0, 0, 25, 0, 0, 169, 0, 25, 0, 289, 0, 0, 25, 0, 0, 0, 0, 25, 169, 0, 0, 841, 25, 0, 0, 0, 289, 25, 0, 1369, 0, 169, 25, 1681, 0, 0, 0, 25, 0, 0, 0, 0, 25, 289, 169, 2809, 0, 25, 0, 0, 841, 0, 25, 3721, 0, 0, 0, 194, 0, 0, 289, 0, 25, 0, 0, 5329, 1369, 25, 0, 0, 169, 0, 25, 0, 1681, 0, 0, 314
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,5
|
|
LINKS
|
|
|
FORMULA
|
Additive with a(p^e) = p^2 if p = 1 (mod 4), 0 otherwise.
|
|
MATHEMATICA
|
Array[DivisorSum[#, #^2 &, And[PrimeQ@ #, Mod[#, 4] == 1] &] &, 85] (* Michael De Vlieger, Jul 11 2017 *)
f[p_, e_] := If[Mod[p, 4] == 1, p^2, 0]; a[n_] := Plus @@ f @@@ FactorInteger[n]; a[1] = 0; Array[a, 100] (* Amiram Eldar, Jun 21 2022 *)
|
|
PROG
|
(PARI) a(n) = my(f=factor(n)); sum(k=1, #f~, if (((p=f[k, 1])%4) == 1, p^2)); \\ Michel Marcus, Jul 11 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|