A046304 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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”).

Other ways to Give

A046304

Divisible by at least 5 primes (counted with multiplicity).

32, 48, 64, 72, 80, 96, 108, 112, 120, 128, 144, 160, 162, 168, 176, 180, 192, 200, 208, 216, 224, 240, 243, 252, 256, 264, 270, 272, 280, 288, 300, 304, 312, 320, 324, 336, 352, 360, 368, 378, 384, 392, 396, 400, 405, 408, 416, 420, 432, 440, 448, 450, 456

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

LINKS

John Cerkan, Table of n, a(n) for n = 1..10000

FORMULA

Product p_i^e_i with Sum e_i >= 5.

a(n) = n + O(n (log log n)^3/log n). - Charles R Greathouse IV, Apr 07 2017

MATHEMATICA

Select[Range[500], PrimeOmega[#]>4&] (* Harvey P. Dale, Apr 16 2013 *)

PROG

(PARI) is(n)=bigomega(n)>4 \\ Charles R Greathouse IV, Sep 17 2015