OFFSET
1,2
COMMENTS
Sequence is strictly increasing based on definition of A380487.
LINKS
Robert Israel, Table of n, a(n) for n = 1..168
EXAMPLE
1 is a term because rad(2)/sopf(2) = 2/2.
3 is a term because rad(30)/sopf(30) = 30/10.
5 is a term because rad(70)/sopf(70) = 70/14.
MAPLE
f:= proc(n, m) local q, S;
S:= numtheory:-factorset(n);
q:= convert(S, `*`)/convert(S, `+`);
if q::integer and q > m then q else 0 fi;
end proc:
m:= 0: R:= NULL: count:= 0:
for n from 2 while count < 50 do
v:= f(n, m);
if v > 0 then
m:= v; R:= R, v; count:= count+1;
fi;
od:
R; # Robert Israel, Apr 30 2025
PROG
(SageMath)
def sopf(n): return sum(set(prime_factors(n)))
def rad(n):
rad = 1
for p in set(prime_factors(n)): rad *= p
return rad
def output(limit=39):
results = []
n = 2
result = 0
while len(results) < limit:
sopf_n = sopf(n)
rad_n = rad(n)
if rad_n % sopf_n == 0 and result < rad_n / sopf_n:
result = rad_n / sopf_n
print(result, end=', ')
n += 1
return
output()
(PARI) lista(nn) = my(m=0, list=List()); for (n=2, nn, my(f=factor(n)[, 1], q=factorback(f)/vecsum(f)); if ((denominator(q) == 1) && (q>m), listput(list, q); m=q); ); Vec(list); \\ Michel Marcus, Mar 29 2025
CROSSREFS
KEYWORD
nonn
AUTHOR
Torlach Rush, Mar 10 2025
STATUS
approved
