A347235 -id:A347235 - cp's OEIS frontend

A342001 Arithmetic derivative without its inherited divisor; the arithmetic derivative of n divided by A003557(n), which is a common divisor of both n and A003415(n).

0, 1, 1, 2, 1, 5, 1, 3, 2, 7, 1, 8, 1, 9, 8, 4, 1, 7, 1, 12, 10, 13, 1, 11, 2, 15, 3, 16, 1, 31, 1, 5, 14, 19, 12, 10, 1, 21, 16, 17, 1, 41, 1, 24, 13, 25, 1, 14, 2, 9, 20, 28, 1, 9, 16, 23, 22, 31, 1, 46, 1, 33, 17, 6, 18, 61, 1, 36, 26, 59, 1, 13, 1, 39, 11, 40, 18, 71, 1, 22, 4, 43, 1, 62, 22, 45, 32, 35, 1, 41, 20

Offset: 1

Antti Karttunen, Feb 28 2021

nonn

See also the scatter plot of A342002 that seems to reveal some interesting internal structure in this sequence, not fully explained by the regularity of primorial base expansion used in the latter sequence. - Antti Karttunen, May 09 2022

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

Cf. A003415, A003557, A341998, A342416, A342459.
Cf. A342002 [= a(A276086(n))], A342463 [= a(A342456(n))], A351945 [= a(A181819(n))], A353571 [= a(A003961(n))].
Cf. A346485 (Möbius transform), A347395 (convolution with Liouville's lambda), A347961 (with itself), and A347234, A347235, A347954, A347959, A347963, A349396, A349612 (for convolutions with other sequences).
Cf. A007947.

Array[#1/#2 & @@ {If[# < 2, 0, # Total[#2/#1 & @@@ FactorInteger[#]]] &@ Abs[#], #/Times @@ FactorInteger[#][[All, 1]]} &, 91] (* Michael De Vlieger, Mar 11 2021 *)

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A003557(n) = (n/factorback(factorint(n)[, 1]));
A342001(n) = (A003415(n) / A003557(n));

from math import prod
from sympy import factorint
def A342001(n):
    q = prod(f:=factorint(n))
    return sum(q*e//p for p, e in f.items()) # Chai Wah Wu, Nov 04 2022

a(n) = A003415(n) / A003557(n).
For all n >= 0, a(A276086(n)) = A342002(n).
a(n) = A342414(n) * A342416(n) = A342459(n) * A342919(n). - Antti Karttunen, Apr 30 2022
Dirichlet g.f.: Dirichlet g.f. of A007947 * Sum_{p prime} p^s/((p^s-1)*(p^s+p-1)) = zeta(s) * Product_{p prime} (1+p^(1-s)-p^(-s)) * Sum_{p prime} p^s/((p^s-1)*(p^s+p-1)). - Sebastian Karlsson, May 05 2022
Sum_{k=1..n} a(k) ~ c * A065464 * Pi^2 * n^2 / 12, where c = Sum_{j>=2} (1/2 + (-1)^j * (Fibonacci(j) - 1/2))*PrimeZetaP(j) = 0.4526952873143153104685540856936425315834753528741817723313791528384... - Vaclav Kotesovec, May 09 2022

A347234 Dirichlet convolution of A126760 with A342001.

Original entry on oeis.org

0, 1, 1, 3, 1, 7, 1, 6, 3, 10, 1, 17, 1, 13, 11, 10, 1, 16, 1, 26, 14, 18, 1, 31, 4, 21, 6, 35, 1, 61, 1, 15, 19, 26, 17, 36, 1, 29, 22, 49, 1, 82, 1, 50, 28, 34, 1, 49, 5, 36, 27, 59, 1, 28, 22, 67, 30, 42, 1, 139, 1, 45, 37, 21, 25, 117, 1, 74, 35, 127, 1, 63, 1, 53, 40, 83, 25, 138, 1, 79, 10, 58, 1, 190, 30, 61

Offset: 1

Antti Karttunen, Aug 26 2021

nonn

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

Cf. A003415, A003557, A126760, A342001.

Cf. also A346485, A347233, A347235, A347395.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A003557(n) = (n/factorback(factorint(n)[, 1]));
A342001(n) = (A003415(n) / A003557(n));
A126760(n) = {n&&n\=3^valuation(n, 3)<A126760
A347234(n) = sumdiv(n,d,A126760(d)*A342001(n/d));

a(n) = Sum_{d|n} A126760(d) * A342001(n/d).

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

A347395 Dirichlet convolution of Liouville's lambda (A008836) with A342001, where A342001(n) = A003415(n)/A003557(n).

Original entry on oeis.org

0, 1, 1, 1, 1, 3, 1, 2, 1, 5, 1, 3, 1, 7, 6, 2, 1, 2, 1, 5, 8, 11, 1, 5, 1, 13, 2, 7, 1, 14, 1, 3, 12, 17, 10, 2, 1, 19, 14, 9, 1, 20, 1, 11, 5, 23, 1, 5, 1, 2, 18, 13, 1, 4, 14, 13, 20, 29, 1, 14, 1, 31, 7, 3, 16, 32, 1, 17, 24, 34, 1, 3, 1, 37, 3, 19, 16, 38, 1, 9, 2, 41, 1, 20, 20, 43, 30, 21, 1, 9, 18, 23, 32

Offset: 1

Antti Karttunen, Sep 02 2021

It seems that all the terms after the initial zero are strictly positive. Checked up to n = 2^24. Compare to A346485.

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

Cf. A003415, A003557, A008836, A342001, A347396 [= a(A276086(n))].

Cf. also A346485, A347235.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A003557(n) = (n/factorback(factorint(n)[, 1]));
A342001(n) = (A003415(n) / A003557(n));
A008836(n) = ((-1)^bigomega(n));
A347395(n) = sumdiv(n,d,A008836(n/d)*A342001(d));

a(n) = Sum_{d|n} A008836(n/d) * A342001(d).

Sum_{k=1..n} a(k) ~ c * A065464 * Pi^4 * n^2 / 180, where c = Sum_{j>=2} (1/2 + (-1)^j * (Fibonacci(j) - 1/2))*PrimeZetaP(j) = 0.4526952873143153104685540856936425315834753528741817723313791528384... - Vaclav Kotesovec, Mar 04 2023

A346485 Möbius transform of A342001, where A342001(n) = A003415(n)/A003557(n).

Original entry on oeis.org

0, 1, 1, 1, 1, 3, 1, 1, 1, 5, 1, 2, 1, 7, 6, 1, 1, 1, 1, 4, 8, 11, 1, 2, 1, 13, 1, 6, 1, 14, 1, 1, 12, 17, 10, 0, 1, 19, 14, 4, 1, 20, 1, 10, 4, 23, 1, 2, 1, 1, 18, 12, 1, 1, 14, 6, 20, 29, 1, 8, 1, 31, 6, 1, 16, 32, 1, 16, 24, 34, 1, 0, 1, 37, 2, 18, 16, 38, 1, 4, 1, 41, 1, 12, 20, 43, 30, 10, 1, 4, 18, 22, 32, 47

Offset: 1

Antti Karttunen, Aug 26 2021

nonn

Conjecture 1: After the initial zero, the positions of other zeros is given by A036785.

Conjecture 2: No negative terms. Checked up to n = 2^24.

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

Cf. A003415, A003557, A008683, A036785, A342001, A347232 [= a(A276086(n))].

Cf. also A300251, A300717, A347234, A347235, A347395.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A003557(n) = (n/factorback(factorint(n)[, 1]));
A342001(n) = (A003415(n) / A003557(n));
A346485(n) = sumdiv(n,d,moebius(n/d)*A342001(d));

a(n) = Sum_{d|n} A008683(n/d) * A342001(d).
Dirichlet g.f.: Product_{p prime} (1+p^(1-s)-p^(-s)) * Sum_{p prime} p^s/((p^s-1)*(p^s+p-1)). - Sebastian Karlsson, May 08 2022
Sum_{k=1..n} a(k) ~ c * A065464 * n^2 / 2, where c = Sum_{j>=2} (1/2 + (-1)^j * (Fibonacci(j) - 1/2))*PrimeZetaP(j) = 0.4526952873143153104685540856936425315834753528741817723313791528384... - Vaclav Kotesovec, Mar 04 2023

A349396 Dirichlet convolution of A342001 ({arithmetic derivative of n}/A003557(n)) with A055615 (Dirichlet inverse of n).

Original entry on oeis.org

0, 1, 1, 0, 1, 0, 1, -1, -1, 0, 1, -2, 1, 0, 0, -2, 1, -6, 1, -2, 0, 0, 1, -2, -3, 0, -3, -2, 1, 0, 1, -3, 0, 0, 0, 2, 1, 0, 0, -2, 1, 0, 1, -2, -6, 0, 1, -2, -5, -20, 0, -2, 1, -6, 0, -2, 0, 0, 1, 0, 1, 0, -6, -4, 0, 0, 1, -2, 0, 0, 1, 8, 1, 0, -20, -2, 0, 0, 1, -2, -5, 0, 1, 0, 0, 0, 0, -2, 1, 0, 0, -2, 0, 0, 0

Offset: 1

Antti Karttunen, Nov 18 2021

sign

Dirichlet convolution of this sequence with A000010 (Euler phi) is A346485.

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

Cf. A003415, A003557, A055615, A342001.
Cf. A346485, A347234,  A347235, A347395, A347954, A347959, A347961, A347963 for Dirichlet convolutions of A342001 with other sequences.
Cf. also A349394.

A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A003557(n) = (n/factorback(factorint(n)[, 1]));
A342001(n) = (A003415(n) / A003557(n));
A055615(n) = (n*moebius(n));
A349396(n) = sumdiv(n,d,A342001(n/d)*A055615(d));

a(n) = Sum_{d|n} A055615(d) * A342001(n/d).

A348027 Dirichlet convolution of Euler phi with A324198.

Original entry on oeis.org

1, 2, 5, 4, 5, 8, 7, 8, 15, 14, 11, 16, 13, 14, 37, 16, 17, 24, 19, 28, 35, 22, 23, 32, 49, 26, 45, 28, 29, 60, 31, 32, 55, 34, 41, 48, 37, 38, 65, 56, 41, 62, 43, 44, 111, 46, 47, 64, 55, 114, 85, 52, 53, 72, 59, 62, 95, 58, 59, 120, 61, 62, 123, 64, 65, 88, 67, 68, 115, 134, 71, 96, 73, 74, 293, 76, 83, 104, 79

Offset: 1

Antti Karttunen, Sep 25 2021

Antti Karttunen, Table of n, a(n) for n = 1..11550
Index entries for sequences related to primorial base

Cf. A000010, A324198.

Cf. also A346242, A347131, A347235, A347958.

s[n_] := Module[{k = n, m = 1, p = 2}, While[k > 0, m *= (p^Min[Mod[k, p], IntegerExponent[n, p]]); k = Quotient[k, p]; p = NextPrime[p]]; m]; a[n_] := DivisorSum[n, s[#] * EulerPhi[n/#] &]; Array[a, 100] (* Amiram Eldar, Nov 27 2021 *)

A324198(n) = { my(m=1, p=2, orgn=n); while(n, m *= (p^min(n%p, valuation(orgn, p))); n = n\p; p = nextprime(1+p)); (m); };
A348027(n) = sumdiv(n,d,eulerphi(d)*A324198(n/d));

a(n) = Sum_{d|n} phi(n/d) * A324198(d).

a(n) = Sum_{k=1..n} A324198(gcd(n,k)).

cp's OEIS Frontend

A342001 Arithmetic derivative without its inherited divisor; the arithmetic derivative of n divided by A003557(n), which is a common divisor of both n and A003415(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A347234 Dirichlet convolution of A126760 with A342001.

Views

Author

Keywords

Links

Crossrefs

Programs

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

A347395 Dirichlet convolution of Liouville's lambda (A008836) with A342001, where A342001(n) = A003415(n)/A003557(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A346485 Möbius transform of A342001, where A342001(n) = A003415(n)/A003557(n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A349396 Dirichlet convolution of A342001 ({arithmetic derivative of n}/A003557(n)) with A055615 (Dirichlet inverse of n).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A348027 Dirichlet convolution of Euler phi with A324198.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula