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.

A178805 Numbers k such that ||k/log(k)|| reaches a new minimum, where ||x|| is the distance from x to the nearest integer.

This page as a plain text file.
%I A178805 #15 Sep 16 2018 04:37:02
%S A178805 2,5,9,13,17,163,53453,110673,715533,1432276,6517719,11523158,
%T A178805 11985596,24102781,254977309,451207448,1219588338,2048539023,
%U A178805 10066616717,42116139191,47657002570,73831354169,122478947521,143949453227,3040705645816,3152420311977,5624690531099,14964977749017,25999244327633,92799025313425,164330745650026,604329910739082
%N A178805 Numbers k such that ||k/log(k)|| reaches a new minimum, where ||x|| is the distance from x to the nearest integer.
%C A178805 The first 9 terms are from Kevin O'Bryant in a Math OverFlow comment. Closely related to A178806.
%C A178805 Added 15 more terms from _Noam D. Elkies_ (second MathOverflow link). - _T. D. Noe_, Feb 12 2013
%H A178805 MathOverflow, <a href="http://mathoverflow.net/questions/27931/">Why Is 163/ln(163) a Near-Integer?</a>
%H A178805 MathOverflow, <a href="http://mathoverflow.net/questions/28088/">When is n/ln(n) close to an integer?</a>
%t A178805 mn=Infinity; n=2; Table[While[r=N[n/Log[n]]; diff=Abs[r-Round[r]]; diff>=mn, n++ ]; mn=diff; Print[{n,mn}]; n, {9}]
%Y A178805 Cf. A050499 (nearest integer to n/log(n)), A178806.
%K A178805 nonn
%O A178805 1,1
%A A178805 _T. D. Noe_, Jun 16 2010