OFFSET
1,3
COMMENTS
It is known that a(n) >= 0 for n >= 2.
REFERENCES
D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, p. 10.
LINKS
T. D. Noe, Table of n, a(n) for n=1..10000
FORMULA
a(n) = 2*n - 4 for prime n. - T. D. Noe, Dec 19 2006
MATHEMATICA
Table[DivisorSigma[2, n] - EulerPhi[n]^2 - DivisorSigma[0, n]^2, {n, 80}] (* G. C. Greubel, Jan 15 2019 *)
PROG
(PARI) vector(80, n, sigma(n, 2) - eulerphi(n)^2 - numdiv(n)^2) \\ G. C. Greubel, Jan 15 2019
(Magma) [DivisorSigma(2, n) - EulerPhi(n)^2 - DivisorSigma(0, n)^2: n in [1..80]]; // G. C. Greubel, Jan 15 2019
(Sage) [sigma(n, 2) - euler_phi(n)^2 - sigma(n, 0)^2 for n in (1..80)] # G. C. Greubel, Jan 15 2019
CROSSREFS
KEYWORD
sign
AUTHOR
N. J. A. Sloane, Jan 23 2003
STATUS
approved