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!)
A372999 a(n) = Sum_{k=1..n} tau( (n/gcd(k,n))^4 ). 3
1, 6, 11, 24, 21, 66, 31, 76, 65, 126, 51, 264, 61, 186, 231, 212, 81, 390, 91, 504, 341, 306, 111, 836, 201, 366, 299, 744, 141, 1386, 151, 548, 561, 486, 651, 1560, 181, 546, 671, 1596, 201, 2046, 211, 1224, 1365, 666, 231, 2332, 409, 1206, 891, 1464, 261, 1794 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
If p is prime, a(p) = 5*p - 4.
a(n) = Sum_{d|n} phi(d) * tau(d^4).
Multiplicative with a(p^e) = (4 - (4*e+5)*p^e + (4*e+1)*p^(e+1))/(p-1). - Amiram Eldar, May 21 2024
MATHEMATICA
f[p_, e_] := (4 - (4*e+5)*p^e + (4*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^4));
CROSSREFS
Sequence in context: A362441 A309742 A362442 * A063629 A076496 A354594
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 June 25 21:12 EDT 2024. Contains 373712 sequences. (Running on oeis4.)