%I #9 Feb 17 2016 17:22:14
%S 1,2,3,1,4,1,1,2,5,1,1,2,1,2,3,1,6,1,1,2,1,2,3,1,1,2,3,1,4,1,1,2,7,1,
%T 1,2,1,2,3,1,1,2,3,1,4,1,1,2,1,2,3,1,4,1,1,2,5,1,1,2,1,2,3,1,8,1,1,2,
%U 1,2,3,1,1,2,3,1,4,1,1,2,1,2,3,1,4,1,1,2,5,1,1,2,1,2,3,1,1,2,3,1,4,1,1,2,5,1,1,2,1,2,3,1,6,1,1,2,1,2,3,1,1
%N One-based index of the toggled bit between n and A268717(n+1): a(n) = A070939(A003987(n,A268717(1+n))).
%C A fractal sequence like A268726.
%H Antti Karttunen, <a href="/A268727/b268727.txt">Table of n, a(n) for n = 0..8191</a>
%F a(n) = A001511(1+A006068(n)).
%F a(n) = A070939(A003987(n,A268717(1+n))).
%F a(n) = 1 + floor(log_2(n XOR A003188(1+A006068(n)))).
%o (Scheme) (define (A268727 n) (A070939 (A003987bi n (A268717 (+ 1 n))))) ;; A003987bi implements the bitwise-XOR, defined in A003987.
%Y One more than A268726.
%Y Cf. A003188, A006068.
%Y Cf. A001511, A003987, A070939, A101080, A268717.
%Y Cf. also array A268833.
%K nonn,base
%O 0,2
%A _Antti Karttunen_, Feb 13 2016