A366258 Dirichlet inverse of A366283, where A366283(n) = gcd(n, A366275(n)).

1, -2, -3, 0, -1, 6, -1, 0, 0, 2, -1, 0, -1, 2, 5, 0, -1, 0, -1, 0, 3, 2, -1, 0, -24, 2, 26, 0, -1, -10, -1, 0, 3, 2, -3, 0, -1, 2, 3, 0, -1, -6, -1, 0, -6, 2, -1, 0, 0, 48, 5, 0, -1, -52, -53, 0, 5, 2, -1, 0, -1, 2, 8, 0, 1, -6, -1, 0, 3, 6, -1, 0, -1, 2, 128, 0, -5, -6, -1, 0, -78, 2, -1, 0, -3, 2, 3, 0, -1, 12

Offset

1,2

Links

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

Index entries for sequences related to binary expansion of n

Formula

a(1) = 1, and for n > 1, a(n) = -Sum_{d|n, d<n} A366283(n/d) * a(d).

Prog

(PARI)
\\ Needs also the program given in A366275:
A366283(n) = gcd(n, A366275(n));
memoA366258 = Map();
A366258(n) = if(1==n, 1, my(v); if(mapisdefined(memoA366258, n, &v), v, v = -sumdiv(n, d, if(d<n, A366283(n/d)*A366258(d), 0)); mapput(memoA366258, n, v); (v)));

Crossrefs

Cf. A366275, A366283, A366259 (rgs-transform).

Cf. also A364257.

Sequence in context: A370507 A263230 A364257 * A319665 A004443 A171616

Adjacent sequences: A366255 A366256 A366257 * A366259 A366260 A366261

Keyword

sign

Author

Antti Karttunen, Oct 07 2023

Status

approved