cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A309968 Numbers n > 1 that give record values for f(n) = sigma(n)/n - e^gamma * log(log(e*d(n))) - e^gamma * log(log(log(e^e * d(n)))), where d(n) is the number of divisors of n (A000005) and sigma(n) is their sum (A000203).

Original entry on oeis.org

2, 74801040398884800, 224403121196654400, 3066842656354276800, 6133685312708553600, 9200527969062830400, 18401055938125660800, 131874234223233902400, 263748468446467804800, 395622702669701707200, 791245405339403414400, 6198089008491993412800, 12396178016983986825600
Offset: 1

Views

Author

Amiram Eldar, Aug 25 2019

Keywords

Comments

Nicolas proved that f(n) reaches its maximum at n = 2^7 * (3#)^4 * 5# * (7#)^2 * 19# * 47# * 277# * 45439# ~ 8.0244105... * 10^19786 which is the last term of this sequence (prime(n)# = A002110(n) is the n-th primorial).

Crossrefs

Subsequence of A025487.