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 A268727 #16 Jun 25 2025 00:28:00 %S A268727 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 A268727 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 A268727 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 A268727 One-based index of the toggled bit between n and A268717(n+1): a(n) = A070939(A003987(n,A268717(1+n))). %C A268727 A fractal sequence like A268726. %H A268727 Antti Karttunen, <a href="/A268727/b268727.txt">Table of n, a(n) for n = 0..8191</a> %F A268727 a(n) = A001511(1+A006068(n)). %F A268727 a(n) = A070939(A003987(n,A268717(1+n))). %F A268727 a(n) = 1 + floor(log_2(n XOR A003188(1+A006068(n)))). %F A268727 a(n) = A001511(n)*(1-A010059(n)) + 1. - _Alan Michael Gómez Calderón_, Jun 15 2025 %o A268727 (Scheme) (define (A268727 n) (A070939 (A003987bi n (A268717 (+ 1 n))))) ;; A003987bi implements the bitwise-XOR, defined in A003987. %Y A268727 One more than A268726. %Y A268727 Cf. A003188, A006068. %Y A268727 Cf. A001511, A003987, A010059, A070939, A101080, A268717. %Y A268727 Cf. also array A268833. %K A268727 nonn,base %O A268727 0,2 %A A268727 _Antti Karttunen_, Feb 13 2016