A384557 The number of exponential unitary (or e-unitary) divisors of n that are exponentially odd numbers (A268335).
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1
Offset: 1
Links
- Amiram Eldar, Table of n, a(n) for n = 1..10000
Crossrefs
Programs
-
Mathematica
f[p_, e_] := 2^PrimeNu[e/2^IntegerExponent[e, 2]]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
-
PARI
a(n) = vecprod(apply(x -> 2^omega(x >> valuation(x, 2)) , factor(n)[, 2]));
Formula
Multiplicative with a(p^e) = A068068(e).
a(n) >= 1, with equality if and only if n is in A138302.
a(n) <= A278908(n), with equality if and only if n is an exponentially odd number.
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Product_{p prime} (1 + Sum_{k>=2} (d(k) - d(k-1))/p^k) = 1.13551542615965557947..., where d(k) is the number of odd unitary divisors of k (A068068).
Comments