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 A296208 #13 Dec 26 2017 17:36:02
%S A296208 1,2,5,4,9,12,10,8,20,24,18,24,22,16,23,16,33,60,34,48,41,56,43,48,39,
%T A296208 36,34,40,55,52,56,32,86,96,65,120,70,104,88,96,78,104,83,120,88,112,
%U A296208 88,96,84,84,71,80,103,104,115,80,72,68,112,96,116,76,75,64,158,244,130,192,168,192,139,240,142,212,175,216
%N A296208 Xor-Moebius transform of A005187.
%C A296208 Unique sequence satisfying SumXOR_{d divides n} a(d) = A005187(n) for all n > 0, where SumXOR is the analog of summation under the binary XOR operation. See A295901 for a list of some of the properties of Xor-Moebius transform. A297111 gives the ordinary Möbius transform of A005187.
%H A296208 Antti Karttunen, <a href="/A296208/b296208.txt">Table of n, a(n) for n = 1..16384</a>
%H A296208 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%o A296208 (PARI)
%o A296208 A005187(n) = { my(s=n); while(n>>=1, s+=n); s; };
%o A296208 A296208(n) = { my(v=0); fordiv(n, d, if(issquarefree(n/d), v=bitxor(v, A005187(d)))); (v); } \\ after code in A295901.
%Y A296208 Cf. A003987, A005187, A256739, A294899, A295901, A296203, A297110, A297111.
%K A296208 nonn,base
%O A296208 1,2
%A A296208 _Antti Karttunen_, Dec 25 2017