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.
%I A280235 #11 Mar 14 2017 20:56:10 %S A280235 1,5,3,7,9,3,9,8,6,0,6,7,5,1,2,6,1,7,4,9,5,7,9,0,8,6,0,7,3,1,2,1,2,2, %T A280235 1,3,6,7,4,9,8,6,3,1,0,8,4,2,5,2,1,0,7,6,2,2,1,4,5,7,2,3,5,7,9,4,3,1, %U A280235 1,9,6,6,9,3,3,8,3,5,1,4,1,7,0,5,4,4,7,9,3 %N A280235 Constant appearing in the Nicolas-Robin bound for the divisor function. %C A280235 The number of divisors of n is at most 2^(k * log n/log log n) where k is this constant. Equality is attained precisely at n = 6983776800. %H A280235 Indranil Ghosh, <a href="/A280235/b280235.txt">Table of n, a(n) for n = 1..150</a> %H A280235 J. L. Nicolas and G. Robin, <a href="http://dx.doi.org/10.4153/CMB-1983-078-5">Majorations explicites pour le nombre de diviseurs de N</a>, Canadian Mathematical Bulletin 26 (1983), pp. 485-492. %e A280235 1.53793986067512617495790860731212213674986310842521076221457235794311... %t A280235 L = Log[6983776800]; RealDigits[2 * Log[48] * Log[L] / L / Log[2], 10, 89][[1]] (* _Indranil Ghosh_, Mar 12 2017 *) %o A280235 (PARI) L=log(6983776800); 2*log(48)*log(L)/L/log(2) %Y A280235 Cf. A217660. %K A280235 cons,nonn %O A280235 1,2 %A A280235 _Charles R Greathouse IV_, Feb 25 2017