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 A268670 #9 Feb 13 2016 23:16:15
%S A268670 1,3,1,7,1,3,5,15,5,3,13,7,9,11,1,31,1,11,29,7,25,27,9,15,17,19,5,23,
%T A268670 13,3,21,63,21,3,61,23,57,59,13,15,49,51,17,55,5,19,53,31,33,35,1,39,
%U A268670 29,11,37,47,9,27,45,7,41,43,25,127,25,43,125,7,121,123,41,47,113,115,9,119,45,27,117,31,97,99,33,103,1
%N A268670 a(n) = A006068(A268669(n)).
%C A268670 All terms are odd, by definition.
%H A268670 Antti Karttunen, <a href="/A268670/b268670.txt">Table of n, a(n) for n = 1..65537</a>
%F A268670 a(n) = A006068(A268669(n)).
%t A268670 f[n_] := Fold[BitXor, n, Quotient[n, 2^Range[BitLength@ n - 1]]]; g[n_] := If[OddQ@ #, n, g[#/2]] &@ f[n]; Table[f@ g@ n, {n, 85}] (* _Michael De Vlieger_, Feb 12 2016, after _Jan Mangaldan_ at A006068 *)
%o A268670 (Scheme) (define (A268670 n) (A006068 (A268669 n)))
%Y A268670 Cf. A001317 (positions of ones).
%Y A268670 Cf. A006068, A268669, A268671.
%K A268670 nonn,base
%O A268670 1,2
%A A268670 _Antti Karttunen_, Feb 10 2016