OFFSET
1,1
COMMENTS
This sequence contains numbers of the form p^u, u >= p, p prime; numbers of the form 2^k*p, p odd prime and k >= floor(log(p)/log(2)). Example: the first number of the form 2^k*67 in the sequence is 2^6*67=4288 because floor(log(67)/log(2))=6.
[Are we to understand that these are all the numbers in the sequence, or just some of them? - N. J. A. Sloane, Dec 27 2018]
If n=p^(p-1) with p prime, n*tau(n) - sigma(n)*bigomega(n) = 1.
From David A. Corneth, Aug 24 2020: (Start)
If n > 1 then each of n, tau(n), sigma(n) and bigomega(n) are > 0. We can then write the inequality as tau(n)/bigomega(n) < sigma(n)/n.
Note that tau(n) and bigomega(n) only depend on the prime signature of n.
Suppose we choose some k from A025487. If k is not a term then no number with that prime signature is not a term. k is the number with the value for sigma(m)/m for numbers m with the same prime signature as k. (End)
LINKS
David A. Corneth, Table of n, a(n) for n = 1..10000 (first 4000 terms from Robert Israel)
MAPLE
filter:= proc(n) local L, t, j;
L:= ifactors(n)[2];
n * mul(t[2]+1, t=L) < mul(add(t[1]^j, j=0..t[2]), t=L)*add(t[2], t=L)
end proc:
select(filter, [$1..1000]); # Robert Israel, Dec 26 2018
MATHEMATICA
filterQ[n_] := n DivisorSigma[0, n] < DivisorSigma[1, n] PrimeOmega[n];
Select[Range[1000], filterQ] (* Jean-François Alcover, Aug 24 2020 *)
PROG
(PARI) isok(n) = n*numdiv(n) < sigma(n)*bigomega(n); \\ Michel Marcus, Dec 27 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Feb 24 2002
EXTENSIONS
Corrected by Robert Israel, Dec 26 2018
STATUS
approved