OFFSET
1,2
LINKS
Amiram Eldar, Table of n, a(n) for n = 1..10000
FORMULA
G.f.: Sum_{k>=1} mu(10 * k) * x^k / (1 - x^k)^2, where mu() is the Moebius function (A008683).
Multiplicative with a(p^e) = p^e if p = 2 or 5, and (p-1)*p^(e-1) otherwise.
From Amiram Eldar, Oct 30 2025; (Start)
Dirichlet g.f.: (zeta(s-1)/zeta(s)) * (2^s/(2^s-1)) * (5^s/(5^s-1)).
Sum_{k=1..n} a(k) ~ 25/(6*Pi^2) * n^2. (End)
MATHEMATICA
a[n_] := EulerPhi[10*n]/4; Array[a, 100] (* Amiram Eldar, Oct 30 2025 *)
PROG
(PARI) a(n) = eulerphi(10*n)/4;
(PARI) my(N=80, x='x+O('x^N)); Vec(sum(k=1, N, moebius(10*k)*x^k/(1-x^k)^2))
CROSSREFS
KEYWORD
nonn,easy,mult
AUTHOR
Seiichi Manyama, May 10 2024
STATUS
approved
