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 A296206 #9 Dec 26 2017 18:03:31
%S A296206 1,2,3,5,5,6,7,10,8,10,11,15,13,14,15,20,17,16,19,17,21,22,23,30,24,
%T A296206 26,24,27,29,30,31,40,33,34,35,40,37,38,39,34,41,42,43,39,40,46,47,60,
%U A296206 48,48,51,57,53,48,55,54,57,58,59,51,61,62,56,80,65,66,67,85,69,70,71,80,73,74,72,95,77,78,79,68,88
%N A296206 Xor-Moebius transform applied twice to natural numbers.
%C A296206 Xor-Moebius transform of A256739, in other words, the unique sequence that satisfies SumXOR_{d divides n} a(d) = A256739(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.
%H A296206 Antti Karttunen, <a href="/A296206/b296206.txt">Table of n, a(n) for n = 1..16384</a>
%H A296206 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%o A296206 (PARI)
%o A296206 A256739(n) = { if(1==n,return(n)); my(x=n); fordiv(n,d,if(d<n,x = bitxor(x,A256739(d)))); (x); };
%o A296206 A296206(n) = { my(v=0); fordiv(n, d, if(issquarefree(n/d), v=bitxor(v, A256739(d)))); (v); } \\ after code in A295901.
%Y A296206 Cf. A003987, A256739, A295901, A296207.
%K A296206 nonn,base
%O A296206 1,2
%A A296206 _Antti Karttunen_, Dec 25 2017