OFFSET
1,1
COMMENTS
Composite numbers k (written as a product of primes p_1 * p_2 * ... * p_m) such that s( {log(log(p_i)) : 1 <= i <= m} ) < s( {i : 1 <= i <= m} ), where s is standard deviation and m = bigomega(k).
Loosely described, these are numbers whose prime factors, including repetitions, are relatively close together. (Note we get the same criterion irrespective of whether s is sample standard deviation or population standard deviation.)
The author's intent is to divide the set of composite numbers into 2 parts whose asymptotic densities differ at most by a small factor. So his choice of criterion was guided by particular information relating to the statistics of prime factors of large numbers.
From Charles R Greathouse IV, May 19 2025: (Start)
For example, semiprimes p*q with p <= q are in this sequence if (and only if) q < p^e where e = 2.71... is the base of the natural logarithm.
For any m, there are finitely many primes p (perhaps none) such that p*m is in the sequence. (End)
The above theorem generalizes: for any m > 1 and any k, there are finitely many k-almost-primes j (perhaps none) such that j*m is in the sequence. - Peter Munn, Feb 25 2026
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..10000
Michael De Vlieger, Plot prime(i)^m | a(n) at (x,y) = (n,i), n = 1..2048, 8X vertical exaggeration, with a color function showing m = 1 in black, m = 2 in red, m = 3 in orange, ..., m = 11 in magenta.
MATHEMATICA
Select[Select[Range[128], CompositeQ], Less @@ Map[StandardDeviation, Transpose@ MapIndexed[{Log@ Log[#1], First[#2]} &, Flatten[ConstantArray[#1, #2] & @@@ FactorInteger[#] ] ] ] &] (* Michael De Vlieger, May 04 2025 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Peter Munn, Feb 18 2025
STATUS
approved
