|
Search: id:A132982
|
|
|
| A132982 |
|
The non-prime-power "antimutinous" numbers. (Antimutinous numbers are those integers m, m >1, where m/p^k < p, p = largest prime divisor of m, p^k = largest power of p that divides m.). |
|
+0
2
|
|
| 6, 10, 14, 15, 18, 20, 21, 22, 26, 28, 33, 34, 35, 38, 39, 42, 44, 46, 50, 51, 52, 54, 55, 57, 58, 62, 65, 66, 68, 69, 74, 75, 76, 77, 78, 82, 85, 86, 87, 88, 91, 92, 93, 94, 95, 98, 99, 100, 102, 104, 106, 110, 111, 114, 115, 116, 117, 118, 119, 122, 123, 124, 129, 130
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
EXAMPLE
|
30 = 2*3*5. 2*3 is > 5, so 30 is not in the sequence because 30 is mutinous (see A027854).
27 = 3^3. 27/3^3 is < 3, so 27 is antimutinous. But 27 is a power of a prime, so 27 is not in the sequence.
However, 20 = 2^2 * 5^1. And 20/5^1 is < 5, so 20 is antimutinous. Also, 20 is not a power of a prime. So 20 is in the sequence.
|
|
MATHEMATICA
|
a = {}; For[n = 2, n < 200, n++, If[ !PrimeQ[n], If[ ! Length[FactorInteger[n]] == 1, b = FactorInteger[n]; m = 0; For[j = 1, j < Length[b] + 1, j++, If[b[[j, 1]]^b[[j, 2]] > m, m = b[[j, 1]]^b[[j, 2]]]; If[n/m < FactorInteger[m][[1, 1]], AppendTo[a, n]]]]]]; a - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Nov 20 2007
|
|
CROSSREFS
|
Cf. A027855.
Sequence in context: A085234 A057714 A143907 this_sequence A069169 A080364 A082092
Adjacent sequences: A132979 A132980 A132981 this_sequence A132983 A132984 A132985
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet (q1qq2qqq3qqqq(AT)yahoo.com), Nov 19 2007
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Nov 20 2007
|
|
|
Search completed in 0.002 seconds
|
