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.

1, 16, 25, 27, 32, 49, 64, 81, 100, 108, 112, 121, 125, 128, 135, 144, 147, 160, 162, 169, 175, 189, 192, 196, 200, 216, 224, 225, 243, 245, 250, 256, 288, 289, 320, 324, 343, 361, 375, 384, 392, 400, 405, 432, 441, 448, 486, 500, 512, 529, 567, 576, 625, 640

Offset

1,2

Links

Amiram Eldar, Table of n, a(n) for n = 1..10000

Formula

Solutions to A095407(x) < A055642(x).

Example

k = 100: prime set = {2,5}, 3 digits and 2 digits of prime factors, so 100 is a term.
k = 147: prime set = {3,7}, 3 digits and 2 digits of prime factors, so 147 is a term.

Mathematica

q[n_] := Total[IntegerLength /@ FactorInteger[n][[;; , 1]]] < IntegerLength[n]; q[1] = True; Select[Range[640], q] (* Amiram Eldar, Mar 25 2025 *)

Crossrefs

Cf. A055642, A095407, A095408, A095410, A095411.

Sequence in context: A334392 A227651 A348320 * A339624 A111026 A124186

Adjacent sequences: A095406 A095407 A095408 * A095410 A095411 A095412

Keyword

base,nonn

Author

Labos Elemer, Jun 21 2004

Status

approved