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