|
|
A084891
|
|
Multiples of 2, 3, 5, or 7, but not 7-smooth.
|
|
2
|
|
|
22, 26, 33, 34, 38, 39, 44, 46, 51, 52, 55, 57, 58, 62, 65, 66, 68, 69, 74, 76, 77, 78, 82, 85, 86, 87, 88, 91, 92, 93, 94, 95, 99, 102, 104, 106, 110, 111, 114, 115, 116, 117, 118, 119, 122, 123, 124, 129, 130, 132, 133, 134, 136, 138, 141, 142, 145, 146
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
|
|
LINKS
|
|
|
MATHEMATICA
|
okQ[n_] := AnyTrue[{2, 3, 5, 7}, Divisible[n, #]&] && FactorInteger[n][[-1, 1]] > 7;
|
|
PROG
|
(PARI) mult2357(m, n) = \\ mult 2, 3, 5, 7 not 7 smooth
{
local(x, a, j, f, ln);
for(x=m, n,
f=0;
if(gcd(x, 210)>1,
a = ifactor(x);
for(j=1, length(a),
if(a[j]>7, f=1; break);
);
if(f, print1(x", "));
);
);
}
ifactor(n) = \\ The vector of the prime factors of n with multiplicity.
{
local(f, j, k, flist);
flist=[];
f=Vec(factor(n));
for(j=1, length(f[1]),
for(k = 1, f[2][j], flist = concat(flist, f[1][j])
);
);
return(flist)
}
(Python)
from sympy import primefactors
def ok(n):
pf = set(primefactors(n))
return pf & {2, 3, 5, 7} and pf - {2, 3, 5, 7}
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|