|
Search: id:A024619
|
|
|
| A024619 |
|
Numbers that are not powers of primes p^k (k >= 0); complement of A000961. |
|
+0
30
|
|
| 6, 10, 12, 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, 100, 102, 104, 105, 106, 108, 110, 111, 112
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Since 1 = p^0 does not have a well defined prime base p it is often excluded from the prime powers, in which case 1 would be prepended to this sequence to give the complement of "Prime powers p^k (k >= 1)". - Daniel Forgues (squid(AT)zensearch.com), Mar 02 2009
The sequence of numbers divisible by a prime number of primes coincides with this up to 210, which has 4 prime factors. - Lior Manor (lior.manor(AT)gmail.com) Aug 23 2001
A085970(n) = Max{k: a(k)<=n}.
Numbers n such that LCM of proper divisors of n equals neither 1 nor n. - Labos E. (labos(AT)ana.sote.hu), Dec 01 2004
|
|
LINKS
|
Daniel Forgues, Table of n, a(n) for n=1,...,8719.
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
FORMULA
|
A020500(a(n))=1 - Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 26 2003
|
|
MAPLE
|
Contribution from Peter Luschny (peter(AT)luschny.de), Aug 11 2009: (Start)
a := proc(n) numtheory[factorset](n); if 1 < nops(%) then n else NULL fi end:
seq(a(i), i=1..110); (End)
|
|
MATHEMATICA
|
Select[Range@111, Length@FactorInteger@# > 1 &] (from Robert G. Wilson v (rgwv(at)rgwv.com), Dec 07 2005)
|
|
CROSSREFS
|
A014963(a(n)) = 1.
A001221(a(n)) > 1.
Sequence in context: A141467 A105642 A064040 this_sequence A106543 A007774 A030231
Adjacent sequences: A024616 A024617 A024618 this_sequence A024620 A024621 A024622
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu)
|
|
|
Search completed in 0.003 seconds
|
