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 A385757 #12 Jul 16 2025 14:35:30
%S A385757 3,5,7,11,13,17,19,23,26,31,34,35,38,39,46,49,51,55,57,58,62,65,69,74,
%T A385757 77,82,85,86,87,91,93,94,95,106,111,115,118,119,121,122,123,129,133,
%U A385757 134,141,142,143,145,146,155,158,159,161,166,169,177,178,183,185,187,194,201,202,203,205
%N A385757 a(n) is the smallest number having n smaller numbers with the same number of prime factors (counted with multiplicity).
%C A385757 a(n) is the least number k such that A335097(k) = n.
%H A385757 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/PrimeFactor.html">Prime Factor</a>.
%e A385757 The smallest number having 9 smaller numbers (4, 6, 9, 10, 14, 15, 21, 22 and 25) with the same number of prime factors (counted with multiplicity) is 26, so a(9) is 26.
%t A385757 a[n_]:=Module[{k = 1, m, cnt}, While[True,m = PrimeOmega[k];cnt = Sum[Boole[PrimeOmega[i] == m], {i, 2, k - 1}];If[cnt == n, Return[k]];k++ ]];Array[a,65] (* _James C. McMahon_, Jul 13 2025 *)
%o A385757 (PARI) a(n) = my(k=2, m=bigomega(k)); while (sum(i=2, k-1, bigomega(i) == m) !=n, k++; m=bigomega(k)); k; \\ _Michel Marcus_, Jul 09 2025
%Y A385757 Cf. A001222, A081376, A338483, A335097.
%K A385757 nonn
%O A385757 1,1
%A A385757 _Ilya Gutkovskiy_, Jul 08 2025