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 A324714 #14 Mar 15 2019 05:14:16
%S A324714 0,0,1,7,3,2,7,8,11,7,15,3,31,4,26,24,63,11,127,4,51,30,255,0,19,10,
%T A324714 28,23,511,40,1023,40,26,14,58,52,2047,124,204,16,4095,48,8191,17,33,
%U A324714 478,16383,8,35,17,64,21,32767,28,115,20,876,232,65535,50,131071,334,36,104,38,45,262143,5,506,62,524287,68,1048575,1786,59
%N A324714 a(n) = A297106(n) XOR A324712(n).
%C A324714 a(n) is also the XOR-Moebius transform of (A156552(d) XOR A323243(d)). See A295901 for the properties of that transform.
%H A324714 Antti Karttunen, <a href="/A324714/b324714.txt">Table of n, a(n) for n = 1..10000</a> (based on Hans Havermann's factorization of A156552)
%H A324714 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A324714 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A324714 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%o A324714 (PARI) A324714(n) = bitxor(A324712(n), A297106(n));
%o A324714 (PARI) A324714(n) = { my(v=0); fordiv(n, d, if(issquarefree(n/d), v=bitxor(v, bitxor(A323243(d),A156552(d))))); (v); }
%Y A324714 Cf. A156552, A295901, A297106, A323243, A324712, A324713.
%K A324714 nonn
%O A324714 1,4
%A A324714 _Antti Karttunen_, Mar 13 2019