Svoboda | Graniru | BBC Russia | Golosameriki | Facebook
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!)
A372997 a(n) = Sum_{k=1..n} tau( (n/gcd(k,n))^3 ). 3
1, 5, 9, 19, 17, 45, 25, 59, 51, 85, 41, 171, 49, 125, 153, 163, 65, 255, 73, 323, 225, 205, 89, 531, 157, 245, 231, 475, 113, 765, 121, 419, 369, 325, 425, 969, 145, 365, 441, 1003, 161, 1125, 169, 779, 867, 445, 185, 1467, 319, 785, 585, 931, 209, 1155, 697, 1475 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
If p is prime, a(p) = 4*p - 3.
a(n) = Sum_{d|n} phi(d) * tau(d^3).
Multiplicative with a(p^e) = (3 - (3*e+4)*p^e + (3*e+1)*p^(e+1))/(p-1). - Amiram Eldar, May 21 2024
MATHEMATICA
f[p_, e_] := (3 - (3*e+4)*p^e + (3*e+1)*p^(e+1))/(p-1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, May 21 2024 *)
PROG
(PARI) a(n) = sumdiv(n, d, eulerphi(d)*numdiv(d^3));
CROSSREFS
Sequence in context: A116453 A046578 A046590 * A344746 A226663 A023521
KEYWORD
nonn,mult
AUTHOR
Seiichi Manyama, May 19 2024
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 September 11 10:43 EDT 2024. Contains 375827 sequences. (Running on oeis4.)