A297159 a(n) = 3*n - 2*phi(n) - sigma(n); Difference between the deficiency of n and its Moebius-transform.

0, 1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 0, 1, 6, 5, 1, 1, 3, 1, 2, 7, 10, 1, -4, 4, 12, 5, 4, 1, 2, 1, 1, 11, 16, 9, -7, 1, 18, 13, -2, 1, 6, 1, 8, 9, 22, 1, -12, 6, 17, 17, 10, 1, 6, 13, 0, 19, 28, 1, -20, 1, 30, 13, 1, 15, 14, 1, 14, 23, 18, 1, -27, 1, 36, 21, 16, 15, 18, 1, -10, 14, 40, 1, -20, 19, 42, 29, 4, 1, -12, 17, 20, 31, 46, 21, -28, 1, 39, 21, 3, 1, 26

Offset

1,6

Links

Antti Karttunen, Table of n, a(n) for n = 1..65537

Formula

a(n) = A033879(n) - A083254(n) = 3*n - 2*A000010(n) - A000203(n).

a(n) = -Sum_{d|n, d<n} A008683(n/d)*A033879(d).

Sum_{k=1..n} a(k) = (3/2 - 6/Pi^2 - Pi^2/12) * n^2 + O(n*log(n)). - Amiram Eldar, Dec 04 2023

Mathematica

a[n_] := 3*n - 2*EulerPhi[n] - DivisorSigma[1, n]; Array[a, 100] (* Amiram Eldar, Dec 04 2023 *)

Prog

(PARI) A297159(n) = (3*n - 2*eulerphi(n) - sigma(n));
(PARI) A297159(n) = -sumdiv(n, d, (d<n)*moebius(n/d)*((2*d)-sigma(d)));
(Python)
from sympy import totient, divisor_sigma
def a(n): return 3*n-2*totient(n)-divisor_sigma(n)
print([a(n) for n in range(1, 101)]) # Indranil Ghosh, Mar 02 2018

Crossrefs

Cf. A000010, A000203, A008683, A033879, A083254.

Cf. also A051709, A296074.

Sequence in context: A010739 A166918 A143576 * A293438 A318622 A353785

Adjacent sequences: A297156 A297157 A297158 * A297160 A297161 A297162

Keyword

sign,easy

Author

Antti Karttunen, Mar 02 2018

Status

approved