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 A379698 #15 Jan 04 2025 22:27:36
%S A379698 0,1,2,1,3,2,4,1,2,3,2,1,5,2,3,1,4,1,3,2,6,1,3,1,4,2,3,1,5,2,3,2,4,3,
%T A379698 1,7,2,2,4,1,2,5,1,3,4,2,6,2,1,3,2,4,1,3,2,5,2,1,4,2,8,2,3,1,4,2,3,5,
%U A379698 1,2,4,1,2,3,6,2,1,4,2,1,2,5,3,2,4,1,2,7,1,3,2,4,3,1,5,2,4,3,6,1,3,2,1,4,2,2,5,1,4,2,3,1,9,3,1,4,2,2,5,1
%N A379698 Exponent of highest power of 2 that divides the n-th practical number A005153(n).
%C A379698 The relationship between a practical number and highest power of 2 that divides it provides an equivalence relation. Practical numbers whose prime factorization have the same exponent of 2.
%H A379698 Frank M Jackson, <a href="/A379698/b379698.txt">Table of n, a(n) for n = 1..10000</a>
%F A379698 a(n) = A007814(A005153(n)).
%e A379698 a(9) = 2. A005153(9) = 20 and the greatest power of 2 that divides 20 is 2.
%t A379698 plst=Last/@ReadList["https://oeis.org/A005153/b005153.txt", {Number, Number}]; lst={}; Do[If[OddQ[plst[[n]]], AppendTo[lst, 0], AppendTo[lst, Last@First@FactorInteger[plst[[n]]]]], {n, 1, 100}]; lst
%Y A379698 Cf. A005153, A007814, A379325.
%K A379698 nonn
%O A379698 1,3
%A A379698 _Frank M Jackson_, Dec 30 2024