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 A364568 #15 Aug 05 2023 15:46:14
%S A364568 1,0,0,0,0,0,2,0,-2,0,4,0,12,2,10,0,-6,-2,4,0,16,4,16,0,26,12,32,4,84,
%T A364568 10,38,0,-20,-6,4,-4,24,4,20,0,44,16,40,8,104,16,56,0,78,26,68,24,152,
%U A364568 32,104,8,262,84,184,20,468,38,130,0,-48,-20,-8,-12,16,4,28,-8,40,24,64,8,168,20,76,0,88,44,104,32
%N A364568 a(n) = A290077(n) - A364567(n).
%H A364568 Antti Karttunen, <a href="/A364568/b364568.txt">Table of n, a(n) for n = 0..16383</a>
%H A364568 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A364568 For n > 0, a(n) = -A364558(A005940(1+n)) = A000010(A005940(1+n)) - 2^A033265(n).
%o A364568 (PARI)
%o A364568 A290077(n) = { my(p=2,z=1); while(n, if(!(n%2), p=nextprime(1+p), z *= (p-(1==(n%4)))); n>>=1); (z); };
%o A364568 A364567(n) = if(!n,n, my(i=1); while(n>1, if((n%4)!=1, i<<=1); n >>= 1); (i));
%o A364568 A364568(n) = (A290077(n) - A364567(n));
%Y A364568 Cf. A000010, A005940, A033265, A290077, A297112, A364558, A364567.
%Y A364568 Cf. also A364499.
%K A364568 sign
%O A364568 0,7
%A A364568 _Antti Karttunen_, Aug 05 2023