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 A324875 #5 Mar 19 2019 23:01:10
%S A324875 0,0,1,1,3,0,7,0,7,7,15,1,31,6,10,8,63,7,127,4,19,0,255,0,19,12,12,13,
%T A324875 511,4,1023,8,26,16,18,12,2047,126,80,16,4095,18,8191,15,1,480,16383,
%U A324875 8,35,17,68,19,32767,12,59,12,368,234,65535,14,131071,336,4,40,38,15,262143,3,506,22,524287,28,1048575,1788,11,109,58,89
%N A324875 Xor-Moebius transform of A324865, where A324865(n) = A323243(n) - A156552(n).
%H A324875 Antti Karttunen, <a href="/A324875/b324875.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552)
%H A324875 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A324875 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A324875 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%o A324875 (PARI)
%o A324875 A324865(n) = (A323243(n) - A156552(n)); \\ Needs also code from A323243.
%o A324875 A324875(n) = { my(v=0); fordiv(n, d, if(issquarefree(n/d), v=bitxor(v, A324865(d)))); (v); };
%Y A324875 Cf. A156552, A323243, A324714, A324865, A324867, A324877.
%K A324875 nonn
%O A324875 1,5
%A A324875 _Antti Karttunen_, Mar 18 2019