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

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,6

Comments

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.

Links

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

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

Formula

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

Prog

(PARI)
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));

Crossrefs

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

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

Sequence in context: A318313 A101021 A357990 * A340084 A317939 A086767

Adjacent sequences: A346482 A346483 A346484 * A346486 A346487 A346488

Keyword

nonn

Author

Antti Karttunen, Aug 26 2021

Status

approved