Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #9 Feb 13 2016 23:16:15
%S 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 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 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 a(n) = A006068(A268669(n)).
%C All terms are odd, by definition.
%H Antti Karttunen, <a href="/A268670/b268670.txt">Table of n, a(n) for n = 1..65537</a>
%F a(n) = A006068(A268669(n)).
%t 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 (Scheme) (define (A268670 n) (A006068 (A268669 n)))
%Y Cf. A001317 (positions of ones).
%Y Cf. A006068, A268669, A268671.
%K nonn,base
%O 1,2
%A _Antti Karttunen_, Feb 10 2016