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!)
A372961 a(n) = Sum_{1 <= x_1, x_2, x_3, x_4 <= n} n/gcd(x_1, x_2, x_3, x_4, n). 2
1, 31, 241, 991, 3121, 7471, 16801, 31711, 58561, 96751, 161041, 238831, 371281, 520831, 752161, 1014751, 1419841, 1815391, 2476081, 3092911, 4049041, 4992271, 6436321, 7642351, 9753121, 11509711, 14230321, 16649791, 20511121, 23316991, 28629121, 32472031, 38810881 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = Sum_{d|n} mu(n/d) * (n/d) * sigma_5(d).
From _Amiram Eldar_, May 21 2024: (Start)
Multiplicative with a(p^e) = (p^(5*e+5) - p^(5*e+1) + p - 1)/(p^5-1).
Dirichlet g.f.: zeta(s)*zeta(s-5)/zeta(s-1).
Sum_{k=1..n} a(k) ~ c * n^6 / 6, where c = zeta(6)/zeta(5) = 0.981112769... . (End)
a(n) = Sum_{1 <= x_1, x_2, x_3, x_4 <= n} ( gcd(x_1, x_2, x_3, n)/gcd(x_1, x_2, x_3, x_4, n) )^4. - _Seiichi Manyama_, May 25 2024
MATHEMATICA
f[p_, e_] := (p^(5*e+5) - p^(5*e+1) + p - 1)/(p^5-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, moebius(n/d)*n/d*sigma(d, 5));
CROSSREFS
Column k=4 of A372968.
Sequence in context: A059899 A140846 A082544 * A173832 A272162 A338893
KEYWORD
nonn,mult
AUTHOR
_Seiichi Manyama_, May 18 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 July 10 00:52 EDT 2024. Contains 374191 sequences. (Running on oeis4.)