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!)
A344134 a(n) = Sum_{i|n, j|n, k|n} lcm(i,j,k). 3
1, 15, 22, 91, 36, 330, 50, 387, 193, 540, 78, 2002, 92, 750, 792, 1363, 120, 2895, 134, 3276, 1100, 1170, 162, 8514, 511, 1380, 1192, 4550, 204, 11880, 218, 4275, 1716, 1800, 1800, 17563, 260, 2010, 2024, 13932, 288, 16500, 302, 7098, 6948, 2430, 330, 29986, 981, 7665, 2640, 8372, 372, 17880 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{i|n, j|n, k|n} n/gcd(i,j,k).
If p is prime, a(p) = 1 + 7*p.
MATHEMATICA
a[n_]:= Sum[n/GCD[i, j, k], {i, (d = Divisors[n])}, {j, d}, {k, d}]; Array[a, 50] (* Amiram Eldar, May 10 2021 *)
PROG
(PARI) a(n) = sumdiv(n, i, sumdiv(n, j, sumdiv(n, k, lcm([i, j, k]))));
(PARI) a(n) = sumdiv(n, i, sumdiv(n, j, sumdiv(n, k, n/gcd([i, j, k]))));
CROSSREFS
Sequence in context: A186525 A236107 A065728 * A241253 A317793 A219683
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 July 14 12:26 EDT 2024. Contains 374318 sequences. (Running on oeis4.)