A347132 -id:A347132 - cp's OEIS frontend

A347130 a(n) = Sum_{d|n} d * A003415(n/d), where A003415 is the arithmetic derivative.

0, 1, 1, 6, 1, 10, 1, 24, 9, 14, 1, 48, 1, 18, 16, 80, 1, 63, 1, 72, 20, 26, 1, 176, 15, 30, 54, 96, 1, 124, 1, 240, 28, 38, 24, 270, 1, 42, 32, 272, 1, 164, 1, 144, 117, 50, 1, 560, 21, 135, 40, 168, 1, 324, 32, 368, 44, 62, 1, 552, 1, 66, 153, 672, 36, 244, 1, 216, 52, 236, 1, 936, 1, 78, 165, 240, 36, 284, 1, 880

Offset: 1

Antti Karttunen, Aug 23 2021

nonn

Dirichlet convolution of the identity function (A000027) with the arithmetic derivative of n (A003415).

Dirichlet convolution of Euler phi (A000010) with A319684.

Antti Karttunen, Table of n, a(n) for n = 1..10080
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537

Inverse Möbius transform of A347131.
Cf. A000010, A000027, A003415, A003557, A319684, A347129.
Cf. also A300251, A305809, A319684, A347132, A347133.

Table[DivisorSum[n, #*(If[# < 2, 0, # Total[#2/#1 & @@@ FactorInteger[#]]] &[n/#]) &], {n, 80}] (* Michael De Vlieger, Oct 21 2021 *)

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A347130(n) = sumdiv(n,d,d*A003415(n/d));

a(n) = Sum_{d|n} d * A003415(n/d).
a(n) = Sum_{d|n} A000010(n/d) * A319684(d).
a(n) = Sum_{d|n} A347131(d).
a(n) = A003557(n) * A347129(n).

A347131 a(n) = Sum_{d|n} phi(n/d) * A003415(d), where A003415 is the arithmetic derivative and phi is Euler totient function.

Original entry on oeis.org

0, 1, 1, 5, 1, 8, 1, 18, 8, 12, 1, 33, 1, 16, 14, 56, 1, 45, 1, 53, 18, 24, 1, 110, 14, 28, 45, 73, 1, 87, 1, 160, 26, 36, 22, 169, 1, 40, 30, 182, 1, 119, 1, 113, 93, 48, 1, 328, 20, 107, 38, 133, 1, 216, 30, 254, 42, 60, 1, 337, 1, 64, 125, 432, 34, 183, 1, 173, 50, 183, 1, 538, 1, 76, 135, 193, 34, 215, 1, 552, 216

Offset: 1

Antti Karttunen, Aug 23 2021

nonn

Dirichlet convolution of A000010 with A003415.

Antti Karttunen, Table of n, a(n) for n = 1..16384
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537

Möbius transform of A347130.
Cf. A000010, A003415.
Cf. also A300251, A305809, A322577, A347132, A347133, A347134, A347235.

f[p_, e_] := e/p; d[1] = 0; d[n_] := n * Plus @@ f @@@ FactorInteger[n]; a[n_] := DivisorSum[n, d[#] * EulerPhi[n/#] &]; Array[a, 100] (* Amiram Eldar, Sep 03 2021 *)

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A347131(n) = sumdiv(n,d,A003415(n/d)*eulerphi(d));

A347131(n) = sum(k=1,n,A003415(gcd(n,k))); \\ (Slow) - Antti Karttunen, Sep 02 2021

a(n) = Sum_{d|n} A000010(n/d) * A003415(d).
a(n) = Sum_{d|n} A008683(n/d) * A347130(d).
a(n) = Sum_{k=1..n} A003415(gcd(n,k)). - Antti Karttunen, Sep 02 2021

A348982 a(n) = Sum_{d|n} psi(n/d) * A322582(d), where psi is Dedekind psi (A001615), A322582(n) = n - A003958(n), and A003958 is fully multiplicative with a(p) = (p-1).

Original entry on oeis.org

0, 1, 1, 6, 1, 11, 1, 22, 9, 15, 1, 52, 1, 19, 17, 66, 1, 69, 1, 76, 21, 27, 1, 176, 15, 31, 51, 100, 1, 145, 1, 178, 29, 39, 25, 288, 1, 43, 33, 264, 1, 189, 1, 148, 123, 51, 1, 508, 21, 145, 41, 172, 1, 339, 33, 352, 45, 63, 1, 632, 1, 67, 159, 450, 37, 277, 1, 220, 53, 265, 1, 924, 1, 79, 175, 244, 37, 321

Offset: 1

Antti Karttunen, Nov 08 2021

nonn

Dirichlet convolution of A001615 with A322582.

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A001615, A003958, A322582, A327251, A348980, A348981, A348982, A348983, A349132.

Cf. also A347132, A349142.

f1[p_, e_] := (p + 1)*p^(e - 1); psi[1] = 1; psi[n_] := Times @@ f1 @@@ FactorInteger[n]; f2[p_, e_] := (p - 1)^e; s[1] = 1; s[n_] := Times @@ f2 @@@ FactorInteger[n]; a[n_] := DivisorSum[n, (# - s[#])*psi[n/#] &]; Array[a, 100] (* Amiram Eldar, Nov 08 2021 *)

A001615(n) = if(1==n,n, my(f=factor(n)); prod(i=1, #f~, f[i, 1]^f[i, 2] + f[i, 1]^(f[i, 2]-1))); \\ After code in A001615
A003958(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1]--); factorback(f); };
A322582(n) = (n-A003958(n));
A348982(n) = sumdiv(n,d,A001615(n/d)*A322582(d));

a(n) = Sum_{d|n} A001615(n/d) * A322582(d).
For all n >= 1, a(n) <= A347132(n) <= A349142(n).
a(n) = A327251(n) - A349132(n). - Antti Karttunen, Nov 14 2021

A349142 a(n) = Sum_{d|n} psi(n/d) * A348507(d), where psi is Dedekind psi (A001615), A348507(n) = A003959(n) - n, and A003959 is fully multiplicative with a(p) = (p+1).

Original entry on oeis.org

0, 1, 1, 8, 1, 13, 1, 40, 11, 17, 1, 80, 1, 21, 19, 164, 1, 99, 1, 112, 23, 29, 1, 364, 17, 33, 77, 144, 1, 191, 1, 604, 31, 41, 27, 528, 1, 45, 35, 524, 1, 243, 1, 208, 165, 53, 1, 1424, 23, 187, 43, 240, 1, 597, 35, 684, 47, 65, 1, 1072, 1, 69, 209, 2084, 39, 347, 1, 304, 55, 327, 1, 2244, 1, 81, 221, 336, 39, 399

Offset: 1

Antti Karttunen, Nov 08 2021

nonn

Dirichlet convolution of A001615 with A348507.

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A001615, A003959, A327251, A348507, A349140, A349141, A349143, A349172.

Cf. also A347132, A348982.

f1[p_, e_] := (p + 1)*p^(e - 1); psi[1] = 1; psi[n_] := Times @@ f1 @@@ FactorInteger[n]; f2[p_, e_] := (p + 1)^e; s[1] = 1; s[n_] := Times @@ f2 @@@ FactorInteger[n]; a[n_] := DivisorSum[n, (s[#] - #)*psi[n/#] &]; Array[a, 100] (* Amiram Eldar, Nov 08 2021 *)

A001615(n) = if(1==n,n, my(f=factor(n)); prod(i=1, #f~, f[i, 1]^f[i, 2] + f[i, 1]^(f[i, 2]-1))); \\ After code in A001615
A003959(n) = { my(f = factor(n)); for(i=1, #f~, f[i, 1]++); factorback(f); };
A348507(n) = (A003959(n) - n);
A349142(n) = sumdiv(n,d,A001615(d)*A348507(n/d));

a(n) = Sum_{d|n} A001615(n/d) * A348507(d).
For all n >= 1, a(n) >= A347132(n) >= A348982(n).
a(n) = A349172(n) - A327251(n). - Antti Karttunen, Nov 14 2021

A347133 a(n) = Sum_{d|n} A003415(n/d) * A069359(d).

Original entry on oeis.org

0, 0, 0, 1, 0, 2, 0, 6, 1, 2, 0, 16, 0, 2, 2, 24, 0, 19, 0, 20, 2, 2, 0, 72, 1, 2, 9, 24, 0, 40, 0, 80, 2, 2, 2, 111, 0, 2, 2, 96, 0, 48, 0, 32, 25, 2, 0, 256, 1, 29, 2, 36, 0, 117, 2, 120, 2, 2, 0, 244, 0, 2, 29, 240, 2, 64, 0, 44, 2, 56, 0, 446, 0, 2, 31, 48, 2, 72, 0, 352, 54, 2, 0, 308, 2, 2, 2, 168, 0, 304, 2, 56

Offset: 1

Antti Karttunen, Aug 23 2021

nonn

Dirichlet convolution of A003415 (arithmetic derivative) with A069359.

Dirichlet convolution of A001221 (omega, number of distinct prime factors of n) with A347131.

Antti Karttunen, Table of n, a(n) for n = 1..10080
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537

Cf. A001221, A003415, A069359, A347131.

Cf. also A300251, A305809, A347132, A347134, A347135.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A069359(n) = (n*sumdiv(n, d, isprime(d)/d)); \\ From A069359
A347133(n) = sumdiv(n,d,A003415(n/d)*A069359(d));

a(n) = Sum_{d|n} A003415(n/d) * A069359(d).

a(n) = Sum_{d|n} A001221(n/d) * A347131(d).

A347135 a(n) = Sum_{d|n} A001615(n/d) * A069359(d).

Original entry on oeis.org

0, 1, 1, 5, 1, 12, 1, 16, 7, 16, 1, 51, 1, 20, 18, 44, 1, 68, 1, 71, 22, 28, 1, 156, 11, 32, 33, 91, 1, 167, 1, 112, 30, 40, 26, 277, 1, 44, 34, 220, 1, 215, 1, 131, 110, 52, 1, 420, 15, 140, 42, 151, 1, 300, 34, 284, 46, 64, 1, 673, 1, 68, 138, 272, 38, 311, 1, 191, 54, 295, 1, 836, 1, 80, 162, 211, 38, 359, 1, 596

Offset: 1

Antti Karttunen, Aug 23 2021

nonn

Dirichlet convolution of A001615 (Dedekind psi function) with A069359.

Dirichlet convolution of A001221 (omega, number of distinct prime factors of n) with A322577.

Antti Karttunen, Table of n, a(n) for n = 1..10000
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537
Wikipedia, Dirichlet convolution

Cf. A001221, A001615, A069359, A322577.

Cf. also A347132, A347133, A347134.

Table[DivisorSum[n,PrimeNu[n/#]*Sum[DirichletConvolve[j,MoebiusMu[j]^2,j,#/d] EulerPhi[d],{d,Divisors[#]}]&],{n,80}] (* Giorgos Kalogeropoulos, Oct 28 2021 *)

A001615(n) = if(1==n,n, my(f=factor(n)); prod(i=1, #f~, f[i, 1]^f[i, 2] + f[i, 1]^(f[i, 2]-1))); \\ After code in A001615
A069359(n) = (n*sumdiv(n, d, isprime(d)/d)); \\ From A069359
A347135(n) = sumdiv(n,d,A001615(n/d)*A069359(d));

a(n) = Sum_{d|n} A001615(n/d) * A069359(d).

a(n) = Sum_{d|n} A001221(n/d) * A322577(d).

cp's OEIS Frontend

A347130 a(n) = Sum_{d|n} d * A003415(n/d), where A003415 is the arithmetic derivative.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A347131 a(n) = Sum_{d|n} phi(n/d) * A003415(d), where A003415 is the arithmetic derivative and phi is Euler totient function.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A348982 a(n) = Sum_{d|n} psi(n/d) * A322582(d), where psi is Dedekind psi (A001615), A322582(n) = n - A003958(n), and A003958 is fully multiplicative with a(p) = (p-1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A349142 a(n) = Sum_{d|n} psi(n/d) * A348507(d), where psi is Dedekind psi (A001615), A348507(n) = A003959(n) - n, and A003959 is fully multiplicative with a(p) = (p+1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A347133 a(n) = Sum_{d|n} A003415(n/d) * A069359(d).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A347135 a(n) = Sum_{d|n} A001615(n/d) * A069359(d).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula