login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A318879 a(n) = Sum_{d|n} [d-(2*phi(d)) > 0]*(d-(2*phi(d))). 8
0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 6, 0, 2, 0, 0, 0, 8, 0, 6, 0, 2, 0, 14, 0, 2, 0, 6, 0, 18, 0, 0, 0, 2, 0, 24, 0, 2, 0, 14, 0, 22, 0, 6, 0, 2, 0, 30, 0, 12, 0, 6, 0, 26, 0, 14, 0, 2, 0, 54, 0, 2, 0, 0, 0, 30, 0, 6, 0, 26, 0, 56, 0, 2, 0, 6, 0, 34, 0, 30, 0, 2, 0, 66, 0, 2, 0, 14, 0, 66, 0, 6, 0, 2, 0, 62, 0, 16, 0, 36, 0, 42, 0, 14, 9 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

LINKS

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

FORMULA

a(n) = -Sum_{d|n} [A083254(d) < 0]*A083254(d), where A083254(n) = 2*phi(n) - n, and [ ] are the Iverson brackets.

a(n) = A318878(n) - A033879(n).

EXAMPLE

n = 105 has divisors [1, 3, 5, 7, 15, 21, 35, 105]. When A083254 is applied to them, we obtain [1, 1, 3, 5, 1, 3, 13, -9]. Summing the negative numbers present, and negating, we get a(105) = -(-9) = 9.

PROG

(PARI) A318879(n) = sumdiv(n, d, d=d-(2*eulerphi(d)); (d>0)*d);

CROSSREFS

Cf. A000010, A033879, A083254, A318878.

Cf. also A318679.

Sequence in context: A328590 A219204 A326067 * A333783 A088886 A317636

Adjacent sequences:  A318876 A318877 A318878 * A318880 A318881 A318882

KEYWORD

nonn

AUTHOR

Antti Karttunen, Sep 05 2018

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 27 13:39 EDT 2020. Contains 337380 sequences. (Running on oeis4.)