Amiram Eldar, <a href="/A368980/b368980_1.txt">Table of n, a(n) for n = 1..10000</a>
Amiram Eldar, <a href="/A368980/b368980_1.txt">Table of n, a(n) for n = 1..10000</a>
proposed
approved
editing
proposed
Sum_{k=1..n} a(k) ~ c * sqrt(n), where c = 1.602317... (A327837 * sqrt(n).
a(n) <= A049419(n), with equality if and only if n = 1.
a(n) >= 0, with equality if and only if n is not a square number (A000037).
Amiram Eldar, <a href="/A368980/b368980_1.txt">Table of n, a(n) for n = 1..10000</a>
allocated for Amiram EldarThe number of exponential divisors of n that are squares (A000290).
1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0
1,16
f[p_, e_] := If[OddQ[e], 0, DivisorSigma[0, e/2]]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
(PARI) a(n) = vecprod(apply(x -> if(x%2, 0, numdiv(x/2)), factor(n)[, 2]));
allocated
nonn,easy,mult
Amiram Eldar, Jan 11 2024
approved
editing
allocated for Amiram Eldar
allocated
approved