This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A359432 #12 Jan 26 2023 04:13:07
%S A359432 1,-1,-1,-1,-1,1,-1,1,0,1,-1,1,-1,1,1,1,-1,0,-1,1,1,1,-1,-1,0,1,-2,1,
%T A359432 -1,-1,-1,-1,1,1,1,0,-1,1,1,-1,-1,-1,-1,1,0,1,-1,-1,0,0,1,1,-1,2,1,-1,
%U A359432 1,1,-1,-1,-1,1,0,-1,1,-1,-1,1,1,-1,-1,0,-1,1,0,1,1,-1,-1,-1,2,1,-1,-1,1,1,1,-1,-1,0,1,1,1,1,1,1,-1,0,0,0,-1,-1,-1,-1,-1,1,-1,2
%N A359432 Dirichlet inverse of A327936, which is multiplicative sequence with a(p^e) = p if e >= p, otherwise 1.
%C A359432 Multiplicative because A327936 is.
%H A359432 Antti Karttunen, <a href="/A359432/b359432.txt">Table of n, a(n) for n = 1..65537</a>
%F A359432 Multiplicative with a(p^e) = (1 - p)^(e/p) if p | e, -(1 - p)^((e - 1)/p) if e == 1 (mod p), and 0 otherwise. - _Amiram Eldar_, Jan 26 2023
%t A359432 f[p_, e_] := Switch[Mod[e, p], 0, (1 - p)^(e/p), 1, -(1 - p)^((e - 1)/p), _, 0]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Table[a[n], {n, 1, 100}] (* _Amiram Eldar_, Jan 26 2023 *)
%o A359432 (PARI)
%o A359432 A327936(n) = { my(f = factor(n)); for(k=1, #f~, f[k,2] = (f[k,2]>=f[k,1])); factorback(f); };
%o A359432 memoA359432 = Map();
%o A359432 A359432(n) = if(1==n,1,my(v); if(mapisdefined(memoA359432,n,&v), v, v = -sumdiv(n,d,if(d<n,A327936(n/d)*A359432(d),0)); mapput(memoA359432,n,v); (v)));
%Y A359432 Cf. A327936.
%Y A359432 Cf. A038838 (positions of even terms), A122132 (of odd terms), A353627 (parity of terms).
%Y A359432 Cf. also A358216, A359433.
%K A359432 sign,mult
%O A359432 1,27
%A A359432 _Antti Karttunen_, Jan 02 2023