STATUS
editing
approved
editing
approved
a:= n-> (p-> `if`(2^p=n, (-1)^p, 0))(ilog2(n)):
seq(a(n), n=1..95); # Alois P. Heinz, Feb 18 2024
approved
editing
Mats Granvik (first 220 terms) & Antti Karttunen, <a href="/A154269/b154269_1.txt">Table of n, a(n) for n = 1..65536</a>
proposed
approved
editing
proposed
nn = 95; a = PadRight[{1, 1}, nn, 0]; Inverse[Table[Table[If[Mod[n, k] == 0, a[[n/k]], 0], {k, 1, nn}], {n, 1, nn}]][[All, 1]] (* Mats Granvik, Jul 24 2017 *)
proposed
editing
editing
proposed
Dirichlet inverse of A019590; Fully multiplicative with with a(2^e) = (-1)^e, a(p^e) = 0 for odd primes p.
proposed
editing
editing
proposed
Dirichlet inverse of A019590; Fully multiplicative with with a(2^e) = (-1, )^e, a(p^e) = 0 for odd primes p.
proposed
editing