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!)
A079539 a(n) = sigma[k](n) - phi(n)^k - d(n)^k for k=3. 3
-1, 0, 12, 38, 54, 180, 120, 457, 514, 1006, 324, 1764, 462, 2816, 2952, 4044, 810, 6381, 1020, 8470, 7840, 10924, 1512, 15356, 7724, 17990, 14544, 23168, 2430, 30728, 2784, 33137, 29232, 40066, 29456, 52804, 3990, 55844, 47656, 69102, 4914, 84448, 5412, 89020 (list; graph; refs; listen; history; text; internal format)
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) = 3*n^2 - 3*n - 6 for prime n. - T. D. Noe, Dec 19 2006

MATHEMATICA

Table[DivisorSigma[3, n] - EulerPhi[n]^3 - DivisorSigma[0, n]^3, {n, 80}] (* G. C. Greubel, Jan 15 2019 *)

PROG

(PARI) vector(80, n, sigma(n, 3) - eulerphi(n)^3 - numdiv(n)^3) \\ G. C. Greubel, Jan 15 2019

(MAGMA) [DivisorSigma(3, n) - EulerPhi(n)^3 - DivisorSigma(0, n)^3: n in [1..80]]; // G. C. Greubel, Jan 15 2019

(Sage) [sigma(n, 3) - euler_phi(n)^3 - sigma(n, 0)^3 for n in (1..80)] # G. C. Greubel, Jan 15 2019

CROSSREFS

Cf. A000010, A000005, A000203, A046520 (for k=1), A079538.

Sequence in context: A043117 A039294 A043897 * A242720 A212510 A213490

Adjacent sequences:  A079536 A079537 A079538 * A079540 A079541 A079542

KEYWORD

sign

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 20 20:02 EDT 2020. Contains 337265 sequences. (Running on oeis4.)