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