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