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 A069517 #22 Aug 29 2023 04:19:59
%S A069517 1,2,0,2,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,
%T A069517 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,
%U A069517 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A069517 a(n) = (-1)*Sum_{d|n} (moebius(d)*(-1)^d).
%C A069517 From _Andrew Howroyd_, Jul 25 2018: (Start)
%C A069517 Moebius transform of A037227.
%C A069517 Multiplicative because A037227 is. (End)
%H A069517 Antti Karttunen, <a href="/A069517/b069517.txt">Table of n, a(n) for n = 1..16384</a>
%F A069517 a(1) = 1 and for n>1, a(n) = 2*A209229(n). - corrected by _Antti Karttunen_, Nov 19 2017
%F A069517 Multiplicative with a(2^e) = 2 and a(p^e) = 0 for an odd prime p. - _Amiram Eldar_, Aug 29 2023
%t A069517 a[n_] := If[n == 2^IntegerExponent[n, 2], 2, 0]; a[1] = 1; Array[a, 100] (* _Amiram Eldar_, Aug 29 2023 *)
%o A069517 (PARI) A069517(n) = (-1)*sumdiv(n,d,moebius(d)*((-1)^d)); \\ _Antti Karttunen_, Nov 19 2017
%o A069517 (PARI) a(n) = if(n == 1, 1, if(n >> valuation(n, 2) == 1, 2, 0)); \\ _Amiram Eldar_, Aug 29 2023
%Y A069517 Cf. A037227, A209229.
%K A069517 easy,nonn,mult
%O A069517 1,2
%A A069517 _Benoit Cloitre_, Apr 16 2002