A007434 -id:A007434 - cp's OEIS frontend

A322078 a(n) = n^2 * Sum_{p|n, p prime} 1/p^2.

0, 1, 1, 4, 1, 13, 1, 16, 9, 29, 1, 52, 1, 53, 34, 64, 1, 117, 1, 116, 58, 125, 1, 208, 25, 173, 81, 212, 1, 361, 1, 256, 130, 293, 74, 468, 1, 365, 178, 464, 1, 673, 1, 500, 306, 533, 1, 832, 49, 725, 298, 692, 1, 1053, 146, 848, 370, 845, 1, 1444, 1, 965, 522

Offset: 1

Daniel Suteu, Nov 25 2018

nonn

Generalized formula is f(n,m) = n^m * Sum_{p|n} 1/p^m, where f(n,0) = A001221(n) and f(n,1) = A069359(n).

Dirichlet convolution of A010051(n) and n^2. - Wesley Ivan Hurt, Jul 15 2025

			a(40) = 464 because the prime factors of 40 are 2 and 5, so we have 40^2 * (1/2^2 + 1/5^2) = 464.

Daniel Suteu, Table of n, a(n) for n = 1..10000

Cf. A000040, A000330, A001221, A007434, A010051, A069359, A085541.

Sequences of the form n^k * Sum_{p|n, p prime} 1/p^k for k = 0..10: A001221 (k=0), A069359 (k=1), this sequence (k=2), A351242 (k=3), A351244 (k=4), A351245 (k=5), A351246 (k=6), A351247 (k=7), A351248 (k=8), A351249 (k=9), A351262 (k=10).

[0] cat [n^2*&+[1/p^2:p in PrimeDivisors(n)]:n in [2..70]]; // Marius A. Burtea, Oct 10 2019

a:= n-> n^2*add(1/i[1]^2, i=ifactors(n)[2]):
seq(a(n), n=1..70);  # Alois P. Heinz, Oct 11 2019

f[p_, e_] := 1/p^2; a[n_] := If[n==1, 0, n^2*Plus@@f@@@FactorInteger[n]]; Array[a, 60] (* Amiram Eldar, Nov 26 2018 *)

a(n) = my(f=factor(n)[,1]~); sum(k=1, #f, n^2\f[k]^2);

Sum_{k=1..n} a(k) ~ A085541 * A000330(n).
G.f.: Sum_{k>=1} x^prime(k) * (1 + x^prime(k)) / (1 - x^prime(k))^3. - Ilya Gutkovskiy, Oct 10 2019
a(n) = 1 <=> n is prime.  _Alois P. Heinz, Oct 11 2019
Dirichlet g.f.: zeta(s-2)*primezeta(s).  This follows because Sum_{n>=1} a(n)/n^s = Sum_{n>=1} (n^2/n^s) Sum_{p|n} 1/p^2. Since n = p*j, rewrite the sum as Sum_{p} Sum_{j>=1} 1/(p^2*(p*j)^(s-2)) = Sum_{p} 1/p^s Sum_{j>=1} 1/j^(s-2) = zeta(s-2)*primezeta(s). The result generalizes to higher powers of p. - Michael Shamos, Mar 02 2023
a(n) = Sum_{d|n} A007434(d)*A001221(n/d). - Ridouane Oudra, Jul 13 2025
From Wesley Ivan Hurt, Jul 15 2025: (Start)
a(n) = Sum_{d|n} c(d) * (n/d)^2, where c = A010051.
a(p^k) = p^(2*k-2) for p prime and k>=1. (End)

A007438 Moebius transform of triangular numbers.

Original entry on oeis.org

1, 2, 5, 7, 14, 13, 27, 26, 39, 38, 65, 50, 90, 75, 100, 100, 152, 111, 189, 148, 198, 185, 275, 196, 310, 258, 333, 294, 434, 292, 495, 392, 490, 440, 588, 438, 702, 549, 684, 584, 860, 582, 945, 730, 876, 803, 1127, 776, 1197, 910, 1168, 1020, 1430

Offset: 1

N. J. A. Sloane

nonn

a(n)=|{(x,y):1<=x<=y<=n, gcd(x,y,n)=1}|. E.g. a(4)=7 because of the pairs (1,1), (1,2), (1,3), (1,4), (2,3), (3,3), (3,4). - Steve Butler, Apr 18 2006
Partial sums of a(n) give A015631(n). - Steve Butler, Apr 18 2006
Equals row sums of triangle A159905. - Gary W. Adamson, Apr 25 2009; corrected by Mats Granvik, Apr 24 2010

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Alois P. Heinz, Table of n, a(n) for n = 1..10000
N. J. A. Sloane, Transforms

Cf. A000217.

Cf. A159905. - Gary W. Adamson, Apr 25 2009

with(numtheory):
a:= proc(n) option remember;
       add(mobius(n/d)*d*(d+1)/2, d=divisors(n))
    end:
seq(a(n), n=1..60);  # Alois P. Heinz, Feb 09 2011

a[n_] := Sum[MoebiusMu[n/d]*d*(d+1)/2, {d, Divisors[n]}]; Array[a, 60] (* Jean-François Alcover, Apr 17 2014 *)

a(n) = sumdiv(n, d, moebius(n/d)*d*(d+1)/2); \\ Michel Marcus, Nov 05 2018

a(n) = (A007434(n)+A000010(n))/2, half the sum of the Mobius transforms of n^2 and n. Dirichlet g.f. (zeta(s-2)+zeta(s-1))/(2*zeta(s)). - R. J. Mathar, Feb 09 2011

G.f.: Sum_{n>=1} a(n)*x^n/(1 - x^n) = x/(1 - x)^3. - Ilya Gutkovskiy, Apr 25 2017

A319445 Number of Eisenstein integers in a reduced system modulo n.

Original entry on oeis.org

1, 3, 6, 12, 24, 18, 36, 48, 54, 72, 120, 72, 144, 108, 144, 192, 288, 162, 324, 288, 216, 360, 528, 288, 600, 432, 486, 432, 840, 432, 900, 768, 720, 864, 864, 648, 1296, 972, 864, 1152, 1680, 648, 1764, 1440, 1296, 1584, 2208, 1152, 1764, 1800, 1728, 1728, 2808

Offset: 1

Jianing Song, Sep 19 2018

Equivalent of phi (A000010) in the ring of Eisenstein integers.
Number of units in the ring Z[w]/nZ[w], where Z[w] is the ring of Eisenstein integers.
a(n) is the number of elements in G(n) = {a + b*w: a, b in Z/nZ and gcd(a^2 + a*b + b^2, n) = 1} where w = (1 + sqrt(3)*i)/2.
a(n) is the number of ordered pairs (a, b) modulo n such that gcd(a^2 + a*b + b^2, n) = 1.
For n > 2, a(n) is divisible by 6.

			Let w = (1 + sqrt(3)*i)/2, w' = (1 - sqrt(3)*i)/2.
{1, w, w'} is the set of 3 units in the Eisenstein integers modulo 2, so a(2) = 3.
{1, w, w^2, -1, w', w'^2} is the set of 6 units in the Eisenstein integers modulo 3, so a(3) = 6.
{1, w, w'} is the set of 3 units in the Eisenstein integers modulo 2, so a(2) = 3.
{1, w, 1 + w, w', 1 + w', -1 + 2w, -1, -w, -1 - w, -w', -1 - w', -1 + 2w'} is the set of 12 units in the Eisenstein integers modulo 4, so a(4) = 12.

Jianing Song, Table of n, a(n) for n = 1..10000
Wikipedia, Eisenstein integer

Cf. A007434.
Equivalent of arithmetic functions in the ring of Eisenstein integers (the corresponding functions in the ring of integers are in the parentheses): A319442 ("d", A000005), A319449 ("sigma", A000203), this sequence ("phi", A000010), A319446 ("psi", A002322), A319443 ("omega", A001221), A319444 ("Omega", A001222), A319448 ("mu", A008683).
Equivalent in the ring of Gaussian integers: A079458.

f[p_, e_] := If[p == 3 , 2*3^(2*e - 1), Switch[Mod[p, 3], 1, (p - 1)^2*p^(2*e - 2), 2, (p^2 - 1)*p^(2*e - 2)]]; eisPhi[1] = 1; eisPhi[n_] := Times @@ f @@@ FactorInteger[n]; Array[eisPhi, 100] (* Amiram Eldar, Feb 10 2020 *)

a(n)=
{
    my(r=1, f=factor(n));
    for(j=1, #f[, 1], my(p=f[j, 1], e=f[j, 2]);
        if(p==3, r*=2*3^(2*e-1));
        if(p%3==1, r*=(p-1)^2*p^(2*e-2));
        if(p%3==2, r*=(p^2-1)*p^(2*e-2));
    );
    return(r);
}

Multiplicative with a(3^e) = 2*3^(2*e-1), a(p^e) = phi(p^e)^2 = (p-1)^2*p^(2*e-2) if p == 1 (mod 3) and J_2(p^e) = A007434(p^e) = (p^2 - 1)*p^(2*e-2) if p == 2 (mod 3).

Sum_{k=1..n} a(k) ~ c * n^3, where c = (8/27) * Product_{p prime == 1 (mod 3)} (1 - 2/p^2 + 1/p^3) * Product_{p prime == 2 (mod 3)} (1 - 1/p^3) = 0.2410535987... . - Amiram Eldar, Feb 13 2024

A282097 Coefficients in q-expansion of (3E_2E_4 - 2*E_6 - E_2^3)/1728, where E_2, E_4, E_6 are the Eisenstein series shown in A006352, A004009, A013973, respectively.

Original entry on oeis.org

0, 1, 12, 36, 112, 150, 432, 392, 960, 1053, 1800, 1452, 4032, 2366, 4704, 5400, 7936, 5202, 12636, 7220, 16800, 14112, 17424, 12696, 34560, 19375, 28392, 29160, 43904, 25230, 64800, 30752, 64512, 52272, 62424, 58800, 117936, 52022, 86640, 85176, 144000, 70602

Offset: 0

Seiichi Manyama, Feb 06 2017

Multiplicative because A000203 is. - Andrew Howroyd, Jul 25 2018

			a(6) = 1^3*6^2 + 2^3*3^2 + 3^3*2^2 + 6^3*1^2 = 432.

Seiichi Manyama, Table of n, a(n) for n = 0..1000

Cf. this sequence (phi_{3, 2}), A282099 (phi_{5, 2}).
Cf. A006352 (E_2), A004009 (E_4), A013973 (E_6), A282018 (E_2^3), A282019 (E_2*E_4).
Cf. A000203 (sigma(n)), A064987 (n*sigma(n)), this sequence (n^2*sigma(n)), A282211 (n^3*sigma(n)).
Cf. A222171.

[0] cat [n^2*DivisorSigma(1, n): n in [1..50]]; // Vincenzo Librandi, Mar 01 2018

a[0]=0;a[n_]:=(n^2)*DivisorSigma[1,n];Table[a[n],{n,0,41}] (* Indranil Ghosh, Feb 21 2017 *)
terms = 42; Ei[n_] = 1-(2n/BernoulliB[n]) Sum[k^(n-1) x^k/(1-x^k), {k, terms}]; CoefficientList[(3*Ei[2]*Ei[4] - 2*Ei[6] - Ei[2]^3)/1728 + O[x]^terms, x] (* Jean-François Alcover, Mar 01 2018 *)

a(n) = if (n==0, 0, n^2*sigma(n)); \\ Michel Marcus, Feb 21 2017

a(n) = (3*A282019(n) - 2*A013973(n) - A282018(n))/1728.
G.f.: phi_{3, 2}(x) where phi_{r, s}(x) = Sum_{n, m>0} m^r * n^s * x^{m*n}.
a(n) = n^2*A000203(n) for n > 0. - Seiichi Manyama, Feb 19 2017
G.f.: Sum_{k>=1} k^3*x^k*(1 + x^k)/(1 - x^k)^3. - Ilya Gutkovskiy, May 02 2018
From Amiram Eldar, Oct 30 2023: (Start)
Multiplicative with a(p^e) = p^(2*e) * (p^(e+1)-1)/(p-1).
Dirichlet g.f.: zeta(s-2)*zeta(s-3).
Sum_{k=1..n} a(k) ~ (Pi^2/24) * n^4. (End)
From Peter Bala, Jan 22 2024: (Start)
a(n) = Sum_{1 <= i, j, k <= n} sigma_2( gcd(i, j, k, n) ).
a(n) = Sum_{1 <= i, j <= n} sigma_3( gcd(i, j, n) ).
a(n) = Sum_{d divides n} sigma_2(d) * J_3(n/d) = Sum_{d divides n} sigma_3(d) * J_2(n/d), where the Jordan totient functions J_2(n) = A007434(n) and J_3(n) = A059376(n). (End)

A034714 Dirichlet convolution of squares with themselves.

Original entry on oeis.org

1, 8, 18, 48, 50, 144, 98, 256, 243, 400, 242, 864, 338, 784, 900, 1280, 578, 1944, 722, 2400, 1764, 1936, 1058, 4608, 1875, 2704, 2916, 4704, 1682, 7200, 1922, 6144, 4356, 4624, 4900, 11664, 2738, 5776, 6084, 12800, 3362, 14112, 3698, 11616, 12150, 8464

Offset: 1

Erich Friedman

Bruno Berselli, Table of n, a(n) for n = 1..1000
Joerg Arndt, On computing the generalized Lambert series, arXiv:1202.6525v3 [math.CA], (2012).

Cf. A000005, A000290, A001620, A038040, A134576, A319085 (partial sums).

[n^2*NumberOfDivisors(n): n in [1..50]]; // Bruno Berselli, Feb 12 2014

A034714 := proc(n) n^2*numtheory[tau](n) ; end proc:
seq(A034714(n),n=1..20) ; # R. J. Mathar, Feb 03 2011

A034714[n_]:=DivisorSigma[0,n]*n^2; Array[A034714, 50] (* Enrique Pérez Herrero, Jun 26 2011 *)

A034714(n)=numdiv(n)*n^2 \\ Enrique Pérez Herrero, Jun 26 2011

Dirichlet g.f.: zeta^2(s-2).
Equals n^2*tau(n), where tau(n) = A000005(n) = number of divisors of n. - Jon Perry, Aug 28 2005
Multiplicative with a(p^e) = (e+1)p^(2e). - Mitch Harris, Jun 27 2005
Row sums of triangle A134576. - Gary W. Adamson, Nov 02 2007
G.f.: Sum_{k>=1} k^2*x^k*(1 + x^k)/(1 - x^k)^3. - Ilya Gutkovskiy, Oct 24 2018
a(n) = n * A038040(n). - Torlach Rush, Feb 01 2019
Sum_{k>=1} 1/a(k) = Product_{primes p} (-p^2 * log(1 - 1/p^2)) = 1.27728092754165872535305748273941301416624226497497308879403022758421224... - Vaclav Kotesovec, Sep 19 2020
G.f.: Sum_{n >= 1} q^(n^2)*( n^4*q^(3*n) - n^2*(n^2 + 4*n - 2)*q^(2*n) - n^2*(n^2 - 4*n - 2)*q^n + n^4 )/(1 - q^n)^3 - apply the operator q*d/dq twice to equation 5 in Arndt and set x = 1. - Peter Bala, Jan 21 2021
Sum_{k=1..n} a(k) ~ (n^3/3) * (log(n) + 2*gamma - 1/3), where gamma is Euler's constant (A001620). - Amiram Eldar, Nov 02 2023
a(n) = Sum_{1 <= i, j <= n} sigma_2( gcd(i, j, n) ) = Sum_{d divides n} sigma_2(d) * J_2(n/d), where sigma_2(n) = A001157(n) and the Jordan totient function J_2(n) = A007434(n). - Peter Bala, Jan 22 2024

A059381 Product J_2(i), i=1..n.

Original entry on oeis.org

1, 3, 24, 288, 6912, 165888, 7962624, 382205952, 27518828544, 1981355655168, 237762678620160, 22825217147535360, 3834636480785940480, 552187653233175429120, 106020029420769682391040, 20355845648787779019079680, 5862483546850880357494947840

Offset: 1

N. J. A. Sloane, Jan 28 2001

nonn

a(n) is also the determinant of the symmetric n X n matrix M defined by M(i,j) = gcd(i,j)^2 for 1 <= i,j <= n. - Avi Peretz, (njk(AT)netvision.net.il), Mar 22 2001

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 203, #17.

G. C. Greubel, Table of n, a(n) for n = 1..250
Antal Bege, Hadamard product of GCD matrices, Acta Univ. Sapientiae, Mathematica, 1, 1 (2009) 43-49.

Cf. A001088, A007434, A175836.

f:= n-> LinearAlgebra:-Determinant(Matrix(n,n,(i,j) -> igcd(i,j)^2)):
map(f, [$1..40]); # Robert Israel, Dec 01 2017

JordanTotient[n_,k_:1] := DivisorSum[n,#^k*MoebiusMu[n/#]&]/;(n>0)&&IntegerQ[n]; A059381[n_]:=Times@@(JordanTotient[#,2]&/@Range[n] ); (* Enrique Pérez Herrero, Dec 29 2010 *)

a(n) = A001088(n)*A175836(n). - Enrique Pérez Herrero, Oct 08 2011

A069093 Jordan function J_8(n).

Original entry on oeis.org

1, 255, 6560, 65280, 390624, 1672800, 5764800, 16711680, 43040160, 99609120, 214358880, 428236800, 815730720, 1470024000, 2562493440, 4278190080, 6975757440, 10975240800, 16983563040, 25499934720, 37817088000

Offset: 1

Benoit Cloitre, Apr 05 2002

a(n) is divisible by 480 = (2^5)*3*5 = A006863(4), except for n = 1, 2, 3 and 5. See Lugo. - Peter Bala, Jan 13 2024

L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 199, #3.

G. C. Greubel, Table of n, a(n) for n = 1..10000
Michael Lugo, A little number theory problem (2008)
Wikipedia, Jordan's totient function.

Cf. A059379 and A059380 (triangle of values of J_k(n)), A000010 (J_1), A007434 (J_2), A059376 (J_3), A059377 (J_4), A059378 (J_5), A069091 - A069095 (J_6 through J_10)

Cf. A013667.

with(numtheory): seq(add(d^8 * mobius(n/d), d in divisors(n)), n = 1..100); # Peter Bala, Jan 13 2024

JordanJ[n_, k_] := DivisorSum[n, #^k*MoebiusMu[n/#] &]; f[n_] := JordanJ[n, 8]; Array[f, 25]
f[p_, e_] := p^(8*e) - p^(8*(e-1)); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Oct 12 2020 *)

for(n=1,100,print1(sumdiv(n,d,d^8*moebius(n/d)),","))

a(n) = Sum_{d|n} d^8*mu(n/d).
Multiplicative with a(p^e) = p^(8e)-p^(8(e-1)).
Dirichlet generating function: zeta(s-8)/zeta(s). - Ralf Stephan, Jul 04 2013
a(n) = n^8*Product_{distinct primes p dividing n} (1-1/p^8). - Tom Edgar, Jan 09 2015
Sum_{k=1..n} a(k) ~ n^9 / (9*zeta(9)). - Vaclav Kotesovec, Feb 07 2019
From Amiram Eldar, Oct 12 2020: (Start)
Limit_{n->oo} (1/n) * Sum_{k=1..n} a(k)/k^8 = 1/zeta(9).
Sum_{n>=1} 1/a(n) = Product_{p prime} (1 + p^8/(p^8-1)^2) = 1.0040927606... (End)

A065469 Decimal expansion of Product_{p prime} (1 - 1/(p^2-1)).

Original entry on oeis.org

5, 3, 0, 7, 1, 1, 8, 2, 0, 4, 7, 2, 0, 4, 4, 7, 9, 4, 9, 7, 2, 9, 4, 3, 7, 7, 2, 4, 7, 2, 9, 7, 7, 1, 7, 0, 9, 4, 7, 8, 6, 1, 0, 2, 2, 2, 0, 9, 8, 6, 0, 4, 0, 3, 4, 7, 5, 8, 1, 9, 0, 4, 9, 2, 8, 0, 9, 0, 5, 0, 6, 7, 9, 2, 6, 0, 9, 5, 7, 9, 0, 6, 3, 8, 6, 3, 8, 1, 9, 2, 4, 5, 6, 3, 6, 2, 3, 5

Offset: 0

N. J. A. Sloane, Nov 19 2001

			0.53071182047204479497294377247...

G. Niklasch, Some number theoretical constants: 1000-digit values. [Cached copy]

Cf. A000010, A000203, A007434, A008683, A013661, A065474, A072101.

$MaxExtraPrecision = 800; digits = 98; terms = 800; P[n_] := PrimeZetaP[n]; LR = LinearRecurrence[{0, 3, 0, -2}, {0, 0, -2, 0}, terms + 10]; r[n_Integer] := LR[[n]]; Exp[NSum[r[n]*P[n - 1]/(n - 1), {n, 3, terms}, NSumTerms -> terms, WorkingPrecision -> digits + 10]] // RealDigits[#, 10, digits]& // First (* Jean-François Alcover, Apr 18 2016 *)

prodeulerrat(1 - 1/(p^2-1)) \\ Amiram Eldar, Mar 13 2021

Product of A013661 by A065474. - R. J. Mathar, Mar 26 2011
From Amiram Eldar, Jan 14 2022: (Start)
Equals Sum_{k>=1} mu(k)/(phi(k)*sigma(k)), where mu is the Möbius function (A008683), phi is the Euler totient function (A000010) and sigma(k) is the sum of divisors of k (A000203).
Equals Sum_{k>=1} mu(k)/J_2(k), where J_2 is Jordan's totient function (A007434). (End)

A078615 a(n) = rad(n)^2, where rad is the squarefree kernel of n (A007947).

Original entry on oeis.org

1, 4, 9, 4, 25, 36, 49, 4, 9, 100, 121, 36, 169, 196, 225, 4, 289, 36, 361, 100, 441, 484, 529, 36, 25, 676, 9, 196, 841, 900, 961, 4, 1089, 1156, 1225, 36, 1369, 1444, 1521, 100, 1681, 1764, 1849, 484, 225, 2116, 2209, 36, 49, 100, 2601, 676, 2809, 36, 3025, 196

Offset: 1

Reinhard Zumkeller, Dec 10 2002

It is conjectured that only 1 and 1782 satisfy a(k) = sigma(k). See Broughan link. - Michel Marcus, Feb 28 2019

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
Peter Bala, GCD sum theorems. Two Multivariable Cesaro Type Identities.
K. Broughan, J.-M. De Koninck, I. Kátai, and F. Luca, On integers for which the sum of divisors is the square of the squarefree core, J. Integer Seq., 15 (2012), pp. 1-12.
Yong-Gao Chen, and Xin Tong, On a conjecture of de Koninck, Journal of Number Theory, Volume 154, September 2015, Pages 324-364. Beware of typo 1728.

Cf. A002117, A007948, A055231, A062378, A330523, A007434, A008683, A001221, A065958.

a := n -> mul(f,f=map(x->x^2,select(isprime,divisors(n))));
seq(a(n), n=1..56);  # Peter Luschny, Mar 30 2014

a[n_] := Times @@ FactorInteger[n][[All, 1]]^2; Array[a, 60] (* Jean-François Alcover, Jun 04 2019 *)

a(n)=my(f=factor(n)[,1]);prod(i=1,#f,f[i])^2 \\ Charles R Greathouse IV, Aug 06 2013

Multiplicative with a(p^e) = p^2. - Mitch Harris, May 17 2005
G.f.: Sum_{k>=1} mu(k)^2*J_2(k)*x^k/(1 - x^k), where J_2() is the Jordan function. - Ilya Gutkovskiy, Nov 06 2018
Sum_{k=1..n} a(k) ~ c * n^3, where c = (zeta(3)/3) * Product_{p prime} (1 - 1/p^2 - 1/p^3 + 1/p^4) = A002117 * A330523 / 3 = 0.214725... . - Amiram Eldar, Oct 30 2022
a(n) = Sum_{1 <= i, j <= n}  ( mobius(n/gcd(i, j, n)) )^2. - Peter Bala, Jan 28 2024
a(n) = Sum_{d|n} mu(d)^2*J_2(d), where J_2 = A007434. - Ridouane Oudra, Jul 24 2025
a(n) = (-1)^omega(n) * Sum_{d|n} mu(d)*Psi_2(d), where omega = A001221 and Psi_2 = A065958. - Ridouane Oudra, Aug 01 2025

A350156 Inverse Moebius transform of A000056.

Original entry on oeis.org

1, 7, 25, 55, 121, 175, 337, 439, 673, 847, 1321, 1375, 2185, 2359, 3025, 3511, 4897, 4711, 6841, 6655, 8425, 9247, 12145, 10975, 15121, 15295, 18169, 18535, 24361, 21175, 29761, 28087, 33025, 34279, 40777, 37015, 50617, 47887, 54625, 53119, 68881, 58975, 79465, 72655, 81433, 85015

Offset: 1

Werner Schulte, Jan 19 2022

Let f be an arbitrary arithmetic function. Define the sequence a(f; n) by a(f; n) = Sum_{i=1..n, k=1..n} f(n / gcd(gcd(i,k),n)) for n > 0. Then a(f; n) equals inverse Moebius transform of f(n) * A007434(n) for n > 0; if f is multiplicative then a(f; n) is multiplicative; this sequence uses f(n) = n (see formula section).

Column k=2 of A372968.
Cf. A000010, A000056, A000578, A001158, A007434, A055615, A057660.
Cf. A372962, A372964.

f[p_, e_] := p^(3*e) - (p - 1)*(p^(3*e) - 1)/(p^3 - 1); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 50] (* Amiram Eldar, Jan 19 2022 *)

from math import prod
from sympy import factorint
def A350156(n): return prod((q:=p**(3*e))-(p-1)*(q-1)//(p**3-1) for p,e in factorint(n).items()) # Chai Wah Wu, Mar 04 2025

Multiplicative with a(p^e) = p^(3*e) - (p-1) * (p^(3*e) - 1) / (p^3 - 1) for prime p and e >= 0.
Dirichlet g.f.: Sum_{n>0} a(n) / n^s = zeta(s-3) * zeta(s) / zeta(s-1).
a(n) = Sum_{i=1..n, k=1..n} n / gcd(gcd(i,k),n) for n > 0.
Dirichlet convolution with A000010 equals A000578.
Dirichlet convolution of A001158 and A055615.
Sum_{k=1..n} a(k) ~ c * n^4, where c = Pi^4/(360*zeta(3)) = 0.225098... . - Amiram Eldar, Oct 16 2022
a(n) = Sum_{d|n} phi(n/d) * (n/d)^2 * sigma_2(d^2)/sigma(d^2). - Seiichi Manyama, May 24 2024
a(n) = Sum_{1 <= x_1, x_2 <= n} ( gcd(x_1, n)/gcd(x_1, x_2, n) )^2. - Seiichi Manyama, May 25 2024

cp's OEIS Frontend

A322078 a(n) = n^2 * Sum_{p|n, p prime} 1/p^2.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A007438 Moebius transform of triangular numbers.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A319445 Number of Eisenstein integers in a reduced system modulo n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A282097 Coefficients in q-expansion of (3*E_2*E_4 - 2*E_6 - E_2^3)/1728, where E_2, E_4, E_6 are the Eisenstein series shown in A006352, A004009, A013973, respectively.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A034714 Dirichlet convolution of squares with themselves.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A059381 Product J_2(i), i=1..n.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A069093 Jordan function J_8(n).

Views

Author

A282097 Coefficients in q-expansion of (3E_2E_4 - 2*E_6 - E_2^3)/1728, where E_2, E_4, E_6 are the Eisenstein series shown in A006352, A004009, A013973, respectively.