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.

A309966 Numbers n > 1 that give record values for f(n) = sigma(n)/(n*log(log(3*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, 116288545977326780410953600, 581442729886633902054768000, 7093601304616933605068169600, 35468006523084668025340848000, 475271287409334551539567363200, 2376356437046672757697836816000, 168721307030313765796546413936000, 1855934377333451423762010553296000
Offset: 1

Views

Author

Amiram Eldar, Aug 25 2019

Keywords

Comments

Nicolas proved that f(n) reaches its maximum at n = 2^3 * (3#)^2 * 5# * 13# * 113# = 8201519488959040182625924708238885435575055666675808000 ~ 8.2 * 10^54 which is the last term of this sequence (prime(n)# = A002110(n) is the n-th primorial).

Crossrefs

Subsequence of A025487.