|
|
A091372
|
|
Number of numbers <= n having more prime factors than the value of their smallest prime factor.
|
|
5
|
|
|
0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 24, 24, 25, 25, 26, 26, 27
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,12
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
For any k < 1, a(n) > kn for large enough k. For example, a(n) > n/2 for n > 26474. - Charles R Greathouse IV, Jul 06 2016
|
|
MATHEMATICA
|
Accumulate@ Boole@ Map[Length@ Flatten[Table[#1, {#2}] & @@@ #] > #[[1, 1]] &@ FactorInteger@ # &, Range@ 80] (* Michael De Vlieger, Jul 06 2016 *)
|
|
PROG
|
(PARI) first(n)=my(v=vector(n), s); for(k=8, n, v[k] = s += bigomega(k) > factor(k)[1, 1]); v \\ Charles R Greathouse IV, Jul 06 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|