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 A095409 #17 Mar 25 2025 16:38:11
%S A095409 1,16,25,27,32,49,64,81,100,108,112,121,125,128,135,144,147,160,162,
%T A095409 169,175,189,192,196,200,216,224,225,243,245,250,256,288,289,320,324,
%U A095409 343,361,375,384,392,400,405,432,441,448,486,500,512,529,567,576,625,640
%N A095409 Numbers k such that total number of decimal digits of all distinct prime factors of k is smaller than number of digits of k.
%H A095409 Amiram Eldar, <a href="/A095409/b095409.txt">Table of n, a(n) for n = 1..10000</a>
%F A095409 Solutions to A095407(x) < A055642(x).
%e A095409 k = 100: prime set = {2,5}, 3 digits and 2 digits of prime factors, so 100 is a term.
%e A095409 k = 147: prime set = {3,7}, 3 digits and 2 digits of prime factors, so 147 is a term.
%t A095409 q[n_] := Total[IntegerLength /@ FactorInteger[n][[;; , 1]]] < IntegerLength[n]; q[1] = True; Select[Range[640], q] (* _Amiram Eldar_, Mar 25 2025 *)
%Y A095409 Cf. A055642, A095407, A095408, A095410, A095411.
%K A095409 base,nonn
%O A095409 1,2
%A A095409 _Labos Elemer_, Jun 21 2004