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 A286576 #8 Jun 01 2017 13:51:51
%S A286576 1,2,2,0,2,1,0,0,2,1,1,0,0,0,0,0,2,1,1,0,1,2,0,0,0,0,0,0,0,0,0,0,2,1,
%T A286576 1,0,1,2,0,0,1,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,1,1,0,
%U A286576 1,2,0,0,1,2,2,0,0,0,0,0,1,2,2,0,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
%N A286576 a(n) = A132971(n) mod 3.
%H A286576 Antti Karttunen, <a href="/A286576/b286576.txt">Table of n, a(n) for n = 0..10922</a>
%H A286576 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%F A286576 a(n) = A010872(A132971(n)) = A132971(n) mod 3.
%o A286576 (Scheme) (define (A286576 n) (modulo (A132971 n) 3))
%o A286576 (Python)
%o A286576 from sympy import mobius, prime, log
%o A286576 import math
%o A286576 def A(n): return n - 2**int(math.floor(log(n, 2)))
%o A286576 def b(n): return n + 1 if n<2 else prime(1 + (len(bin(n)[2:]) - bin(n)[2:].count("1"))) * b(A(n))
%o A286576 def a(n): return mobius(b(n))%3 # _Indranil Ghosh_, May 30 2017
%Y A286576 Cf. A010872, A132971.
%K A286576 nonn,base
%O A286576 0,2
%A A286576 _Antti Karttunen_, May 30 2017