login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A074739
Numbers n such that omega(n) > log(log(n)).
1
2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 18, 20, 21, 22, 24, 26, 28, 30, 33, 34, 35, 36, 38, 39, 40, 42, 44, 45, 46, 48, 50, 51, 52, 54, 55, 56, 57, 58, 60, 62, 63, 65, 66, 68, 69, 70, 72, 74, 75, 76, 77, 78, 80, 82, 84, 85, 86, 87, 88, 90, 91, 92, 93, 94, 95, 96, 98, 99
OFFSET
1,1
COMMENTS
Erdős showed that this sequence has density 1/2.
LINKS
Paul Erdős, Note on the number of prime divisors of integers, J. London Math. Soc., Vol. 12 (1937), pp. 308-314; alternative link.
FORMULA
a(n) ~ 2n. - Charles R Greathouse IV, Dec 05 2012
MATHEMATICA
Select[Range[2, 100], PrimeNu[#] > Log[Log[#]] &] (* Amiram Eldar, Feb 09 2020 *)
PROG
(PARI) is(n)=omega(n) > log(log(n)) \\ Charles R Greathouse IV, Dec 05 2012
CROSSREFS
Cf. A001221.
Sequence in context: A023784 A028823 A258264 * A341750 A246096 A098314
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Sep 05 2002
STATUS
approved