|
|
A353076
|
|
Odd positive integers k such that sigma(k) > exp(gamma) * k * log(log(k))/2.
|
|
1
|
|
|
3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 33, 35, 39, 45, 51, 55, 57, 63, 65, 69, 75, 81, 87, 93, 99, 105, 117, 135, 147, 153, 165, 171, 189, 195, 207, 225, 231, 255, 273, 285, 297, 315, 345, 351, 357, 375, 399, 405, 435, 441, 465, 495, 525, 555, 567, 585
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
The first 23 oddly colossally abundant numbers (A110464) are in this sequence.
According to a proof by Washington and Yang (2021), the Riemann hypothesis is equivalent to the statement that all the terms of this sequence are smaller than A110464(24) = 18565284664427130919514350125.
|
|
LINKS
|
|
|
EXAMPLE
|
3 is in the sequence since 3 is odd and sigma(3) = 4 > exp(gamma) * 3 * log(log(3))/2 = 0.251... .
|
|
MATHEMATICA
|
Select[Range[3, 600, 2], DivisorSigma[1, #] > Exp[EulerGamma] * # * Log[Log[#]]/2 &]
|
|
PROG
|
(Python) from sympy import divisor_sigma, EulerGamma, E, log
print([k for k in range(3, 600, 2) if divisor_sigma(k) > (E**EulerGamma * k * log(log(k)) / 2)]) # Karl-Heinz Hofmann, Apr 22 2022
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|