A374537 a(n) is the sum of the squares of the divisors of n that are exponentially odd numbers.
1, 5, 10, 5, 26, 50, 50, 69, 10, 130, 122, 50, 170, 250, 260, 69, 290, 50, 362, 130, 500, 610, 530, 690, 26, 850, 739, 250, 842, 1300, 962, 1093, 1220, 1450, 1300, 50, 1370, 1810, 1700, 1794, 1682, 2500, 1850, 610, 260, 2650, 2210, 690, 50, 130, 2900, 850, 2810
Offset: 1
Links
- Amiram Eldar, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
Mathematica
f[p_, e_] := 1 + p^2 * (p^(4*Floor[(e-1)/2]+4) - 1) / (p^4 - 1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
-
PARI
a(n) = {my(f = factor(n), p = f[, 1], e = f[, 2]); prod(i = 1, #p, 1 + p[i]^2 * (p[i]^(4*((e[i]-1)\2)+4) - 1) / (p[i]^4 - 1));}
Formula
Multiplicative with a(p^e) = 1 + p^2 * (p^(4*floor((e-1)/2)+4) - 1) / (p^4 - 1).
Dirichlet g.f.: zeta(s) * zeta(2*s-4) * Product_{p prime} (1 + 1/p^(s-2) - 1/p^(2*s-4)).
Comments