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!)
A344139 a(n) = Sum_{x_1|n, x_2|n, x_3|n, x_4|n, x_5|n} gcd(x_1,x_2,x_3,x_4,x_5). 6
1, 33, 34, 277, 36, 1122, 38, 1335, 313, 1188, 42, 9418, 44, 1254, 1224, 4771, 48, 10329, 50, 9972, 1292, 1386, 54, 45390, 391, 1452, 1720, 10526, 60, 40392, 62, 14193, 1428, 1584, 1368, 86701, 68, 1650, 1496, 48060, 72, 42636, 74, 11634, 11268, 1782, 78, 162214, 477, 12903, 1632, 12188, 84 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{x_1|n, x_2|n, x_3|n, x_4|n, x_5|n} n/lcm(x_1,x_2,x_3,x_4,x_5).
a(n) = Sum_{d|n} phi(n/d) * tau(d)^5.
If p is prime, a(p) = 31 + p.
a(n) = Sum_{k=1..n} tau(gcd(k,n))^5.
MATHEMATICA
a[n_] := DivisorSum[n, EulerPhi[n/#] * DivisorSigma[0, #]^5 &]; Array[a, 20] (* Amiram Eldar, May 10 2021 *)
PROG
(PARI) a(n) = sumdiv(n, i, sumdiv(n, j, sumdiv(n, k, sumdiv(n, l, sumdiv(n, m, gcd([i, j, k, l, m]))))));
(PARI) a(n) = sumdiv(n, i, sumdiv(n, j, sumdiv(n, k, sumdiv(n, l, sumdiv(n, m, n/lcm([i, j, k, l, m]))))));
(PARI) a(n) = sumdiv(n, d, eulerphi(n/d)*numdiv(d)^5);
(PARI) a(n) = sum(k=1, n, numdiv(gcd(k, n))^5);
CROSSREFS
Sequence in context: A335072 A260678 A329658 * A140143 A041543 A144425
KEYWORD
nonn,mult
AUTHOR
Seiichi Manyama, May 10 2021
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 August 11 17:02 EDT 2024. Contains 375073 sequences. (Running on oeis4.)