|
| |
|
|
A080257
|
|
Numbers having at least two distinct or a total of at least three prime factors.
|
|
13
|
|
|
|
6, 8, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 26, 27, 28, 30, 32, 33, 34, 35, 36, 38, 39, 40, 42, 44, 45, 46, 48, 50, 51, 52, 54, 55, 56, 57, 58, 60, 62, 63, 64, 65, 66, 68, 69, 70, 72, 74, 75, 76, 77, 78, 80, 81, 82, 84, 85, 86, 87, 88, 90, 91, 92, 93, 94, 95, 96, 98, 99, 100
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
Complement of A000430; A080256(a(n)) > 3.
A084114(a(n)) > 0, see also A084110.
Also numbers greater than the square of their smallest prime-factor: a(n)>A020639(a(n))^2=A088377(a(n));
a(n)>A000430(k) for n<=13, a(n) < A000430(k) for n>13.
Numbers with at least 4 divisors. - Franklin T. Adams-Watters, Jul 28 2006
Union of A024619 and A033942; A211110(a(n)) > 2. - Reinhard Zumkeller, Apr 02 2012
|
|
|
LINKS
|
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
|
|
|
FORMULA
|
a(n) = n + O(n/log n). - Charles R Greathouse IV, Sep 14 2015
|
|
|
EXAMPLE
|
8=2*2*2 and 10=2*5 are terms; 4=2*2 is not a term.
|
|
|
MATHEMATICA
|
Select[Range[100], PrimeNu[#]>1||PrimeOmega[#]>2&] (* Harvey P. Dale, Jul 23 2013 *)
|
|
|
PROG
|
(Haskell)
a080257 n = a080257_list !! (n-1)
a080257_list = m a024619_list a033942_list where
m xs'@(x:xs) ys'@(y:ys) | x < y = x : m xs ys'
| x == y = x : m xs ys
| x > y = y : m xs' ys
-- Reinhard Zumkeller, Apr 02 2012
(PARI) is(n)=omega(n)>1 || isprimepower(n)>2
|
|
|
CROSSREFS
|
Cf. A001248, A001221, A001222, A006881, A030078, A088381, A088383, A000005.
Sequence in context: A071278 A079772 A080731 * A050199 A268388 A139118
Adjacent sequences: A080254 A080255 A080256 * A080258 A080259 A080260
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Reinhard Zumkeller, Feb 10 2003
|
|
|
EXTENSIONS
|
Definition clarified by Harvey P. Dale, Jul 23 2013
|
|
|
STATUS
|
approved
|
| |
|
|
