OFFSET
1,9
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = Sum_{d|n, gcd(d, n/d)=1, d odd square} sqrt(d).
Multiplicative with a(2^e) = 1, and for p > 2, a(p^e) = p^(e/2) + 1 if e is even and 1 if e is odd.
Dirichlet g.f.: (zeta(s)*zeta(2*s-1)/zeta(3*s-1))*(2^(3*s)-2^(s+1))/(2^(3*s)-2).
Sum_{k=1..n} a(k) ~ (2*n/Pi^2)*(log(n) + 3*gamma - 1 + log(2) - 3*zeta'(2)/zeta(2)), where gamma is Euler's constant (A001620).
MATHEMATICA
f[p_, e_] := If[OddQ[e], 1, p^(e/2) + 1]; f[2, e_] := 1; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]
PROG
(PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, if(f[i, 1] == 2, 1, if(f[i, 2]%2, 1, f[i, 1]^(f[i, 2]/2) + 1))); }
CROSSREFS
KEYWORD
nonn,easy,mult
AUTHOR
Amiram Eldar, Jan 29 2023
STATUS
approved