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 A373094 #6 May 24 2024 03:28:16
%S A373094 1,4,7,12,24,120,1260,1829520
%N A373094 a(n) is the least number k such that A373092(k) = n.
%C A373094 a(n) is the least number k such that the number of iterations of the map x -> A093653(x) required to reach from k to a fixed point is n.
%C A373094 a(8) > 4*10^10.
%e A373094 The iterations for the n = 0..7 are:
%e A373094 n a(n) iterations
%e A373094 - ------- --------------------------------------------------
%e A373094 0 1 1
%e A373094 1 4 4 -> 3
%e A373094 2 7 7 -> 4 -> 3
%e A373094 3 12 12 -> 9 -> 5 ->3
%e A373094 4 24 24 -> 12 -> 9 -> 5 -> 3
%e A373094 5 120 120 -> 36 -> 15 -> 9 -> 5 -> 3
%e A373094 6 1260 1260 -> 120 -> 36 -> 15 -> 9 -> 5 -> 3
%e A373094 7 1829520 1829520 -> 1260 -> 120 -> 36 -> 15 -> 9 -> 5 -> 3
%t A373094 d[n_] := d[n] = DivisorSum[n, Plus @@ IntegerDigits[#, 2] &];
%t A373094 f[n_] := -2 + Length@ FixedPointList[d, n];
%t A373094 seq[len_] := Module[{s = Table[0, {len}], c = 0, i, n = 1}, While[c < len, i = f[n] + 1; If[i <= len && s[[i]] == 0, c++; s[[i]] = n]; n++]; s]; seq[7]
%o A373094 (PARI) f(n) = {my(c = 0); while(6 % n, n = sumdiv(n, d, hammingweight(d)); c++); c;}
%o A373094 lista(len) = {my(s = vector(len), c = 0, i, n = 1); while(c < len, i = f(n) + 1; if(i <= len && s[i] == 0, c++; s[i] = n); n++); s;}
%Y A373094 Cf. A093653, A095347 (decimal analog), A373092.
%K A373094 nonn,base,hard,more
%O A373094 0,2
%A A373094 _Amiram Eldar_, May 23 2024