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 A284574 #9 Jun 30 2022 08:39:53 %S A284574 0,0,0,2,0,0,1,0,0,0,0,2,2,2,0,2,0,0,0,2,0,0,1,0,1,1,1,0,0,0,1,0,0,0, %T A284574 0,2,0,0,1,0,0,0,0,2,2,2,0,2,2,2,2,1,2,2,0,2,0,0,0,2,2,2,0,2,0,0,0,2, %U A284574 0,0,1,0,0,0,0,2,2,2,0,2,0,0,0,2,0,0,1,0,1,1,1,0,0,0,1,0,1,1,1,0,1,1,2,1,1,1,1,0,0,0,1,0,0,0,0,2,0,0,1,0,1 %N A284574 a(n) = A048724(n) mod 3. %H A284574 Antti Karttunen, <a href="/A284574/b284574.txt">Table of n, a(n) for n = 0..8192</a> %H A284574 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a> %F A284574 a(n) = A048724(n) mod 3. %o A284574 (Scheme) (define (A284574 n) (modulo (A048724 n) 3)) %o A284574 (Python) %o A284574 def A284574(n): return (n^ n<<1)%3 # _Chai Wah Wu_, Jun 29 2022 %Y A284574 Cf. A048724, A284557, A284575. %K A284574 nonn,base %O A284574 0,4 %A A284574 _Antti Karttunen_, Apr 10 2017