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 A373092 #10 May 24 2024 01:33:16
%S A373092 0,0,0,1,1,0,2,2,2,1,2,3,2,3,3,2,1,2,2,3,3,3,2,4,1,3,3,4,2,3,1,1,3,1,
%T A373092 3,4,2,3,2,4,2,3,2,4,4,2,1,4,3,4,3,4,2,3,3,3,2,2,1,4,1,4,2,3,3,3,2,3,
%U A373092 2,3,2,4,2,3,3,4,3,4,1,4,4,3,2,4,3,2,4
%N A373092 The number of iterations of the map x -> A093653(x) that are required to reach from n to one of the fixed points, 1, 2, 3 or 6.
%H A373092 Amiram Eldar, <a href="/A373092/b373092.txt">Table of n, a(n) for n = 1..10000</a>
%e A373092 The iterations for the n = 1..7 are:
%e A373092 n a(n) iterations
%e A373092 - ---- -----------
%e A373092 1 0 1
%e A373092 2 0 2
%e A373092 3 0 3
%e A373092 4 1 4 -> 3
%e A373092 5 1 5 -> 3
%e A373092 6 0 6
%e A373092 7 2 7 -> 4 -> 3
%t A373092 d[n_] := DivisorSum[n, Plus @@ IntegerDigits[#, 2] &]; a[n_] := -2 + Length@ FixedPointList[d, n]; Array[a, 100]
%o A373092 (PARI) a(n) = {my(c = 0); while(6 % n, n = sumdiv(n, d, hammingweight(d)); c++); c;}
%Y A373092 Cf. A086793 (decimal analog), A093653, A373093, A373094.
%K A373092 nonn,easy,base
%O A373092 1,7
%A A373092 _Amiram Eldar_, May 23 2024