A366725 Sum of odd indices of distinct prime factors of n.
0, 1, 0, 1, 3, 1, 0, 1, 0, 4, 5, 1, 0, 1, 3, 1, 7, 1, 0, 4, 0, 6, 9, 1, 3, 1, 0, 1, 0, 4, 11, 1, 5, 8, 3, 1, 0, 1, 0, 4, 13, 1, 0, 6, 3, 10, 15, 1, 0, 4, 7, 1, 0, 1, 8, 1, 0, 1, 17, 4, 0, 12, 0, 1, 3, 6, 19, 8, 9, 4, 0, 1, 21, 1, 3, 1, 5, 1, 0, 4, 0, 14, 23, 1, 10, 1, 0, 6, 0, 4, 0, 10, 11, 16, 3, 1, 25, 1, 5, 4
Offset: 1
Keywords
Examples
a(60) = 4 because 60 = 2^2 * 3 * 5 = prime(1)^2 * prime(2) * prime(3) and 1 + 3 = 4.
Links
- Amiram Eldar, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
Mathematica
nmax = 100; CoefficientList[Series[Sum[(2 k - 1) x^Prime[2 k - 1]/(1 - x^Prime[2 k - 1]), {k, 1, nmax}], {x, 0, nmax}], x] // Rest f[p_, e_] := Module[{i = PrimePi[p]}, If[OddQ[i], i, 0]]; a[1] = 0; a[n_] := Plus @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Jul 03 2025 *) -
PARI
f(n) = if(n % 2, n, 0); a(n) = vecsum(apply(x -> f(primepi(x)), factor(n)[, 1])); \\ Amiram Eldar, Jul 03 2025
Formula
G.f.: Sum_{k>=1} (2*k-1) * x^prime(2*k-1) / (1 - x^prime(2*k-1)).
From Amiram Eldar, Jul 03 2025: (Start)
Additive with a(p^e) = pi(p) if pi(p) is odd, and 0 otherwise.