|
|
A359833
|
|
Dirichlet inverse of A359832, where A359832(n) = 1 if the 2-adic valuation of n is either 0 or odd, otherwise 0.
|
|
3
|
|
|
1, -1, -1, 1, -1, 1, -1, -2, 0, 1, -1, -1, -1, 1, 1, 3, -1, 0, -1, -1, 1, 1, -1, 2, 0, 1, 0, -1, -1, -1, -1, -5, 1, 1, 1, 0, -1, 1, 1, 2, -1, -1, -1, -1, 0, 1, -1, -3, 0, 0, 1, -1, -1, 0, 1, 2, 1, 1, -1, 1, -1, 1, 0, 8, 1, -1, -1, -1, 1, -1, -1, 0, -1, 1, 0, -1, 1, -1, -1, -3, 0, 1, -1, 1, 1, 1, 1, 2, -1, 0, 1, -1, 1, 1, 1, 5, -1, 0, 0, 0, -1, -1, -1, 2, -1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,8
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
a(1) = 1, and for n > 1, a(n) = -Sum_{d|n, d<n} A359832(n/d) * a(d).
Multiplicative with a(2^e) = (-1)^e*Fibonacci(e), and for p > 2, a(p^e) = -1 if e = 1 and 0 otherwise. - Amiram Eldar, Jan 24 2023
|
|
MATHEMATICA
|
f[p_, e_] := If[e == 1, -1, 0]; f[2, e_] := (-1)^e*Fibonacci[e]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Jan 24 2023 *)
|
|
PROG
|
(PARI) A359833(n) = { my(f=factor(n)); prod(k=1, #f~, if(2==f[k, 1], ((-1)^f[k, 2])*fibonacci(f[k, 2]), -(1==f[k, 2]))); }; \\ Antti Karttunen, Jan 25 2023
|
|
CROSSREFS
|
|
|
KEYWORD
|
sign,mult
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|