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 A284266 #10 Mar 28 2017 14:46:25
%S A284266 1,2,1,3,2,3,1,4,3,3,2,3,3,4,1,5,4,3,3,2,1,3,2,3,3,4,3,3,4,5,1,6,5,3,
%T A284266 4,3,3,2,3,3,2,3,1,4,3,3,2,3,3,4,3,3,2,3,3,4,3,5,4,3,5,6,1,7,6,3,5,4,
%U A284266 3,3,4,5,3,2,3,5,2,3,3,4,3,3,2,5,3,4,1,5,2,3,3,6,3,3,2,3,3,4,3,5,2,3,3,2,1,3,2,5,3,4,3,5,4,5,3,4,3,3,4,5,3
%N A284266 Odd bisection of A277700, binary weight of terms of A283975.
%H A284266 Antti Karttunen, <a href="/A284266/b284266.txt">Table of n, a(n) for n = 0..8192</a>
%H A284266 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A284266 a(n) = A277700((2*n)+1).
%F A284266 a(n) = A000120(A283975(n)).
%F A284266 Other identities. For all n >= 0:
%F A284266 A007306(1+n) = a(n) + 2*A284265(n).
%t A284266 A264977[n_]:= If[n<2, n, If[EvenQ[n], 2 A264977[n/2], BitXor[A264977[(n - 1)/2], A264977[(n + 1)/2]]]]; Table[DigitCount[A264977[2n + 1], 2, 1], {n, 0, 150}] (* _Indranil Ghosh_, Mar 28 2017 *)
%o A284266 (Scheme)
%o A284266 (define (A284266 n) (A277700 (+ n n 1)))
%o A284266 (define (A284266 n) (A000120 (A283975 n)))
%o A284266 (PARI) a(n) = if(n<2, n, if(n%2, bitxor(a((n - 1)/2), a((n + 1)/2)), 2*a(n/2)));
%o A284266 b(n) = if(n<1, 0, b(n\2) + n%2);
%o A284266 for(n=0, 150, print1(b(a(2*n + 1)),", ")) \\ _Indranil Ghosh_, Mar 28 2017
%Y A284266 Cf. A000120, A007306, A277700, A283484, A283975, A284265.
%K A284266 nonn
%O A284266 0,2
%A A284266 _Antti Karttunen_, Mar 25 2017