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 A153701 #9 Mar 23 2019 17:58:22
%S A153701 1,2,3,9,29,45,75,135,219,732,1351,3315,4795,4920,5469,28414,37373
%N A153701 Minimal exponents m such that the fractional part of e^m obtains a minimum (when starting with m=1).
%C A153701 Recursive definition: a(1)=1, a(n) = least number m>a(n-1) such that the fractional part of e^m is less than the fractional part of e^k for all k, 1<=k<m.
%C A153701 The next such number must be greater than 100000.
%C A153701 a(18) > 300,000. _Robert Price_, Mar 23 2019
%F A153701 Recursion: a(1):=1, a(k):=min{ m>1 | fract(e^m) < fract(e^a(k-1))}, where fract(x) = x-floor(x).
%e A153701 a(4)=9, since fract(e^9)=0.08392..., but fract(e^k)>=0.08553... for 1<=k<=8; thus fract(e^9)<fract(e^k) for 1<=k<9.
%t A153701 $MaxExtraPrecision = 100000;
%t A153701 p = 1; Select[Range[1, 300000],
%t A153701 If[FractionalPart[E^#] < p, p = FractionalPart[E^#]; True] &] (* _Robert Price_, Mar 23 2019 *)
%Y A153701 Cf. A153661, A153669, A153677, A153685, A153693, A153705, A154130, A137994, A153717, A000149.
%K A153701 nonn,more
%O A153701 1,2
%A A153701 _Hieronymus Fischer_, Jan 06 2009