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 A349260 #7 Nov 12 2021 20:04:57
%S A349260 1,2,6,8,24,120,216,128,384,1920,3456,17280,120960,432000,279936,
%T A349260 32768,98304,491520,884736,4423680,30965760,110592000,71663616,
%U A349260 358318080,2508226560,8957952000,62705664000,689762304000,3072577536000,5598720000000,470184984576,2147483648
%N A349260 a(n) is the least number k such that A349258(k) = n.
%H A349260 Amiram Eldar, <a href="/A349260/b349260.txt">Table of n, a(n) for n = 0..111</a>
%e A349260 a(2) = 6 since A349258(6) = 2 and A349258(k) != 2 for all k < 6.
%t A349260 f[p_, e_] := 2^DigitCount[e, 2, 1] - 1; d[1] = 0; d[n_] := Plus @@ f @@@ FactorInteger[n]; seq[len_, nmax_] := Module[{s = Table[0, {len}], k = 0, n = 1, i}, While[k < len && n < nmax, i = d[n] + 1; If[i <= len && s[[i]] == 0, k++; s[[i]] = n]; n++]; TakeWhile[s, # > 0 &]]; seq[15, 10^6]
%Y A349260 Cf. A349258, A349259.
%K A349260 nonn
%O A349260 0,2
%A A349260 _Amiram Eldar_, Nov 12 2021