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 A115024 #39 Jul 28 2020 20:00:13
%S A115024 2,3,5,7,10,14,15,21,22,25,26,33,34,35,38,39,46,49,51,55,57,58,62,65,
%T A115024 69,74,77,82,85,86,87,91,93,94,95,102,105,110,114,116,117,124,125,130,
%U A115024 138,147,148,153,154,164,165,170,171,172,174,175,182,186,188,190,195
%N A115024 Natural numbers n such that the number of prime factors of n (counted with multiplicity) is equal to the number of decimal digits of n.
%H A115024 Charles R Greathouse IV, <a href="/A115024/b115024.txt">Table of n, a(n) for n = 1..10000</a>
%e A115024 25 = 5*5 and 25 has two digits.
%e A115024 116 = 2*2*29 and 116 has three digits.
%t A115024 Select[Range[2, 300], Sum[FactorInteger[ # ][[i]][[2]], {i, 1, Length[FactorInteger[ # ]]}] == Floor[Log[10, # ] + 1] &] (* _Stefan Steinerberger_, Feb 27 2006 *)
%t A115024 Select[Range[200],PrimeOmega[#]==IntegerLength[#]&] (* _Harvey P. Dale_, Jul 28 2020 *)
%o A115024 (PARI) is(n)=#Str(n)==bigomega(n) \\ _Charles R Greathouse IV_, Feb 04 2013
%Y A115024 Cf. A165256, A167050.
%K A115024 base,easy,nonn
%O A115024 1,1
%A A115024 _Giovanni Teofilatto_, Feb 24 2006
%E A115024 More terms from _Stefan Steinerberger_, Feb 27 2006