login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A079535 a(n) = phi(n)*d(n) - n. 3
0, 0, 1, 2, 3, 2, 5, 8, 9, 6, 9, 12, 11, 10, 17, 24, 15, 18, 17, 28, 27, 18, 21, 40, 35, 22, 45, 44, 27, 34, 29, 64, 47, 30, 61, 72, 35, 34, 57, 88, 39, 54, 41, 76, 99, 42, 45, 112, 77, 70, 77, 92, 51, 90, 105, 136, 87, 54, 57, 132, 59, 58, 153, 160, 127, 94, 65, 124, 107, 122, 69 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
COMMENTS
It is known that a(n) >= 0.
REFERENCES
D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, p. 10.
LINKS
MATHEMATICA
Table[EulerPhi[n]*DivisorSigma[0, n] - n, {n, 1, 80}] (* G. C. Greubel, Jan 14 2019 *)
PROG
(PARI) vector(80, n, eulerphi(n)*sigma(n, 0) - n) \\ G. C. Greubel, Jan 14 2019
(Magma) [EulerPhi(n)*DivisorSigma(0, n) - n: n in [1..80]]; // G. C. Greubel, Jan 14 2019
(Sage) [euler_phi(n)*sigma(n, 0) - n for n in (1..80)] # G. C. Greubel, Jan 14 2019
CROSSREFS
Sequence in context: A151549 A086989 A110642 * A367859 A349789 A337354
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jan 23 2003
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 08:08 EDT 2024. Contains 371265 sequences. (Running on oeis4.)