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!)
A372962 a(n) = Sum_{1 <= x_1, x_2, x_3 <= n} ( n/gcd(x_1, x_2, x_3, n) )^2. 9

%I #25 May 25 2024 09:02:15

%S 1,29,235,925,3101,6815,16759,29597,57097,89929,160931,217375,371125,

%T 486011,728735,947101,1419569,1655813,2475739,2868425,3938365,4666999,

%U 6435815,6955295,9690601,10762625,13874563,15502075,20510309,21133315,28628191,30307229,37818785

%N a(n) = Sum_{1 <= x_1, x_2, x_3 <= n} ( n/gcd(x_1, x_2, x_3, n) )^2.

%H Amiram Eldar, <a href="/A372962/b372962.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) = Sum_{d|n} mu(n/d) * (n/d)^2 * sigma_5(d).

%F From _Amiram Eldar_, May 21 2024: (Start)

%F Multiplicative with a(p^e) = (p^(5*e+5) - p^(5*e+2) + p^2 - 1)/(p^5-1).

%F Dirichlet g.f.: zeta(s)*zeta(s-5)/zeta(s-2).

%F Sum_{k=1..n} a(k) ~ c * n^6 / 6, where c = zeta(6)/zeta(4) = 2*Pi^2/21 = 0.939962323... (1/A088246). (End)

%F a(n) = Sum_{d|n} phi(n/d) * (n/d)^4 * sigma_4(d^2)/sigma_2(d^2). - _Seiichi Manyama_, May 24 2024

%F a(n) = Sum_{1 <= x_1, x_2, x_3 <= n} ( gcd(x_1, n)/gcd(x_1, x_2, x_3, n) )^3. - _Seiichi Manyama_, May 25 2024

%t f[p_, e_] := (p^(5*e+5) - p^(5*e+2) + p^2 - 1)/(p^5-1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* _Amiram Eldar_, May 21 2024 *)

%o (PARI) a(n) = sumdiv(n, d, moebius(n/d)*(n/d)^2*sigma(d, 5));

%Y Cf. A068963, A084218, A372963.

%Y Cf. A001160, A008683.

%Y Cf. A013662, A013664, A088246.

%Y Cf. A350156, A372964.

%Y Cf. A371492, A372952.

%K nonn,mult

%O 1,2

%A _Seiichi Manyama_, May 18 2024

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 11 14:43 EDT 2024. Contains 374234 sequences. (Running on oeis4.)