OFFSET
1,3
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
FORMULA
a(n) = if n mod 4 = 2 then 0 else A000010(n). - Reinhard Zumkeller, Jun 13 2012
From Amiram Eldar, Nov 02 2023: (Start)
Multiplicative with a(2) = 0, a(2^e) = 2^(e-1) for e >= 2, and a(p^e) = (p-1)*p^(e-1) for an odd prime p.
Dirichlet g.f.: (1 - 2^(1-s) + 1/(2^s-1)) * zeta(s-1) / zeta(s).
Sum_{k=1..n} a(k) ~ (5/(2*Pi^2)) * n^2. (End)
MATHEMATICA
a[n_] := If[Mod[n, 4] == 2, 0, EulerPhi[n]]; Array[a, 100] (* Amiram Eldar, Nov 02 2023 *)
PROG
(PARI) {for(n=1, 81, f=factor(n); print1(if(n==1, 1, if(f[1, 1]==2&&f[1, 2]==1, 0, prod(j=1, matsize(f)[1], eulerphi(f[j, 1]^f[j, 2])))), ", "))}
(Haskell)
a080736 n = if n `mod` 4 == 2 then 0 else a000010 n
-- Reinhard Zumkeller, Jun 13 2012, Jun 11 2012
CROSSREFS
KEYWORD
nonn,easy,mult
AUTHOR
N. J. A. Sloane, Mar 08 2003
EXTENSIONS
More terms and PARI code from Klaus Brockhaus, Mar 10 2003
STATUS
approved