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 A095411 #15 Mar 25 2025 15:32:42
%S A095411 6,22,26,30,33,34,38,39,42,44,46,51,52,55,57,58,60,62,65,66,68,69,70,
%T A095411 74,76,77,78,82,84,85,86,87,88,90,91,92,93,94,95,99,102,110,114,130,
%U A095411 132,138,143,154,156,165,170,174,182,186,187,190,195,198,202,204,206,209
%N A095411 Numbers k such that total number of decimal digits of all distinct prime factors of k is larger than the number of digits of k.
%H A095411 Amiram Eldar, <a href="/A095411/b095411.txt">Table of n, a(n) for n = 1..10000</a>
%F A095411 Solutions to A095407(x) > A055642(x).
%e A095411 For k=55: 2 digits, prime set={5,11} with {5,1,1} digits, 3>2, so 55 is a term.
%t A095411 q[n_] := Total[IntegerLength /@ FactorInteger[n][[;; , 1]]] > IntegerLength[n]; q[1] = False; Select[Range[210], q] (* _Amiram Eldar_, Mar 25 2025 *)
%Y A095411 Cf. A055642, A095407, A095408, A095409, A095410.
%K A095411 base,nonn
%O A095411 1,1
%A A095411 _Labos Elemer_, Jun 21 2004
%E A095411 Name corrected by _Amiram Eldar_, Mar 25 2025