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 A099544 #11 Aug 29 2024 09:16:21
%S A099544 1,1,0,1,2,0,1,1,0,2,2,0,1,1,0,1,2,0,1,2,0,2,2,0,1,1,0,1,2,0,1,1,0,2,
%T A099544 2,0,1,1,0,2,2,0,1,2,0,2,2,0,1,1,0,1,2,0,1,1,0,2,2,0,1,1,0,1,2,0,1,2,
%U A099544 0,2,2,0,1,1,0,1,2,0,1,2,0,2,2,0,1,1,0,2,2,0,1,2,0,2,2,0,1,1,0,1,2,0
%N A099544 Odd part of n modulo 3.
%C A099544 0 if multiple of 3, 1 if of the form 2^j*(3*k+1) with 3*k+1 odd, 2 otherwise.
%H A099544 Amiram Eldar, <a href="/A099544/b099544.txt">Table of n, a(n) for n = 1..10000</a>
%F A099544 a(n) = A010872(A000265(n)).
%F A099544 Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = 1. - _Amiram Eldar_, Aug 29 2024
%t A099544 a[n_] := Mod[n / 2^IntegerExponent[n, 2], 3]; Array[a, 100] (* _Amiram Eldar_, Aug 29 2024 *)
%o A099544 (PARI) a(n) = (n>>valuation(n,2))%3 \\ _Charles R Greathouse IV_, May 14 2014
%Y A099544 Cf. A000265, A010872.
%Y A099544 Cf. A099545, A099546, A099547, A099548, A099549, A099550, A099551.
%K A099544 nonn,easy
%O A099544 1,5
%A A099544 _Ralf Stephan_, Oct 23 2004