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.

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

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