OFFSET
1,1
COMMENTS
It is proved that the function f reaches its maximum for n = 6983776800, and that max n>=2 f(n) = 1.5379. The proof deals with superior highly composite numbers introduced by Ramanujan. So n = 6983776800 is the final term of this sequence.
LINKS
J. L. Nicolas and G. Robin, Majorations explicites pour le nombre de diviseurs de N, Canad. Math. Bull. 26(1983), pp. 485-492.
PROG
(PARI) f(n) = {maxx = -999; for (i=2, n, x = (log(numdiv(i))*log(log(i)))/(log(2)*log(i)); if (x > maxx, maxx = x; print1(i, ", "); ); ); }
CROSSREFS
KEYWORD
nonn,fini,full
AUTHOR
Michel Marcus, Nov 01 2012
EXTENSIONS
a(36) and keyword "full" added by Donovan Johnson, Nov 01 2012
STATUS
approved