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 A359869 #19 Jan 20 2023 09:03:24
%S A359869 4,8,9,12,16,18,24,25,27,32,36,40,48,49,50,54,64,72,80,81,96,98,100,
%T A359869 108,112,121,125,128,144,160,162,169,192,196,200,216,224,225,242,243,
%U A359869 250,256,288,289,320,324,338,343,361,375,384,392,400,405,432,448,484,486,500
%N A359869 Numbers whose product of distinct prime factors is less than the sum of its prime factors (with repetition).
%C A359869 Numbers n where A007947(n) < A001414(n).
%e A359869 12 = 2^2*3 is a term since its product of distinct prime factors 2 * 3 = 6 is less than its sum of prime factors with multiplicity 2 + 2 + 3 = 7.
%e A359869 45 = 3^2*5 is not a term since its product of distinct prime factors 3 * 5 = 15 is greater than its sum of prime factors with multiplicity 3 + 3 + 5 = 11.
%e A359869 All prime numbers fail as terms since the product of distinct prime factors is equal to sum of prime factors.
%t A359869 q[n_] := Module[{f = FactorInteger[n]}, Times @@ f[[;; , 1]] < Plus @@ (f[[;; , 1]]*f[[;; , 2]])]; Select[Range[500], q] (* _Amiram Eldar_, Jan 16 2023 *)
%o A359869 (PARI) isok(n)={my(f=factor(n)); vecprod(f[, 1]) < sum(i=1, #f~, f[i, 1]*f[i, 2])} \\ _Andrew Howroyd_, Jan 16 2023
%Y A359869 Cf. A001414, A007947.
%K A359869 nonn
%O A359869 1,1
%A A359869 _Johan Lindgren_, Jan 16 2023