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 A297110 #8 Dec 26 2017 17:33:44
%S A297110 1,2,3,4,7,4,4,8,12,8,12,8,8,12,15,16,31,20,28,16,31,20,27,16,23,24,
%T A297110 28,24,23,16,20,32,48,32,63,40,56,36,48,32,48,32,51,40,48,44,52,32,36,
%U A297110 56,63,48,39,36,47,48,48,56,44,32,40,60,63,64,112,80,124,64,96,64,123,80,112,72,111,72,127,80,116,64
%N A297110 Xor-Moebius transform of A006068, inverse of the binary Gray code.
%C A297110 Unique sequence satisfying SumXOR_{d divides n} a(d) = A006068(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 the Xor-Moebius transform.
%H A297110 Antti Karttunen, <a href="/A297110/b297110.txt">Table of n, a(n) for n = 1..16384</a>
%H A297110 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%o A297110 (PARI)
%o A297110 A006068(n)= { my(s=1, ns); while(1, ns = n >> s; if(0==ns, break()); n = bitxor(n, ns); s <<= 1; ); return (n); } \\ Essentially _Joerg Arndt_'s Jul 19 2012 code.
%o A297110 A297110(n) = { my(v=0); fordiv(n, d, if(issquarefree(n/d), v=bitxor(v, A006068(d)))); (v); };
%Y A297110 Cf. A006068, A256739, A295901, A296208.
%K A297110 nonn,base
%O A297110 1,2
%A A297110 _Antti Karttunen_, Dec 25 2017