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 A324877 #7 Mar 19 2019 23:01:23
%S A324877 0,1,3,3,7,6,15,4,3,11,31,13,63,30,6,0,127,11,255,28,11,48,511,24,27,
%T A324877 108,4,61,1023,16,2047,24,42,208,10,20,4095,510,48,32,8191,58,16383,
%U A324877 111,25,736,32767,56,51,9,132,211,65535,20,11,108,240,1770,131071,38,262143,3408,52,8,70,95,524287,387,762,62,1048575,44,2097151,7932,19,877,10
%N A324877 Xor-Moebius transform of A324867, where A324867(n) = A156552(n) XOR (A323243(n) - A156552(n)).
%H A324877 Antti Karttunen, <a href="/A324877/b324877.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552)
%H A324877 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A324877 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A324877 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%o A324877 (PARI)
%o A324877 A324867(n) = { my(k=A156552(n)); bitxor(k,(A323243(n)-k)); }; \\ Needs also code from A323243.
%o A324877 A324877(n) = { my(v=0); fordiv(n, d, if(issquarefree(n/d), v=bitxor(v, A324867(d)))); (v); };
%Y A324877 Cf. A156552, A323243, A324867, A324875.
%K A324877 nonn
%O A324877 1,3
%A A324877 _Antti Karttunen_, Mar 18 2019