OFFSET
1,2
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..1000
Ilya Gutkovskiy, Scatter plot of a(n) up to n=50000
Vaclav Kotesovec, Graph - the asymptotic ratio (100000 terms)
FORMULA
a(p^k) = (p - 1)*(k + 1) where p is a prime and k > 0.
a(n) = 2^omega(n)*phi(n) if n is a squarefree (A005117), where omega() = A001221 and phi() = A000010.
From Vaclav Kotesovec, Nov 12 2025: (Start)
Sum_{k=1..n} a(k) ~ ((2*log(n) + 4*gamma - 1)*c + 2*d) * n^2/4, where
c = Product_{p prime} (1 - (5*p^2 + p - 2) / (p^2*(p+1)^2)) = 0.20758836569019514329433091663143001768944005...,
d = c * Sum_{p prime} 2*(4*p^3 + 2*p^2 - 3*p - 2) * log(p) / ((p-1)*(p+1)*(p^3 + 3*p^2 - p - 2)) = c * 2.85393173508558785972941925618814684884850264644...
and gamma is the Euler-Mascheroni constant A001620. (End)
EXAMPLE
a(20) = a(2^2*5) = (2 - 1)*(2 + 1) * (5 - 1)*(1 + 1) = 24.
MAPLE
a:= n-> mul((i[1]-1)*(i[2]+1), i=ifactors(n)[2]):
seq(a(n), n=1..80); # Alois P. Heinz, Jan 05 2021
MATHEMATICA
a[n_] := Times @@ ((#[[1]] - 1) (#[[2]] + 1) & /@ FactorInteger[n]); a[1] = 1; Table[a[n], {n, 70}]
Table[DivisorSigma[0, n] EulerPhi[Last[Select[Divisors[n], SquareFreeQ]]], {n, 70}]
PROG
(PARI) a(n)={my(f=factor(n)); prod(i=1, #f~, my(p=f[i, 1], e=f[i, 2]); (p-1)*(e+1))} \\ Andrew Howroyd, Jul 24 2018
CROSSREFS
KEYWORD
nonn,mult
AUTHOR
Ilya Gutkovskiy, May 12 2018
STATUS
approved
