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 A153706 #10 Mar 03 2020 02:50:29 %S A153706 1,2,11,11,964,34015,156075,952945,170942,247768,397506 %N A153706 Greatest number m such that the fractional part of e^A153702(n) <= 1/m. %F A153706 a(n) = floor(1/fract(e^A153702(n))), where fract(x) = x - floor(x). %e A153706 a(3) = 11 since 1/12 < fract(e^A153702(3)) = fract(e^3) = 0.0855... <= 1/11. %t A153706 Floor[1/(#-Floor[#])]&/@Exp[Select[Range[1000],FractionalPart[E^#]<(1/#)&]] (* _Julien Kluge_, Sep 20 2016 *) %Y A153706 Cf. A153662, A153670, A153678, A153686, A153694, A153702, A154130, A153714, A153722. %Y A153706 Cf. A000149. %K A153706 nonn,more %O A153706 1,2 %A A153706 _Hieronymus Fischer_, Jan 06 2009 %E A153706 a(10)-a(11) from _Jinyuan Wang_, Mar 03 2020