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 A153689 #13 Mar 26 2019 11:46:36
%S A153689 10,18,253,618,6009,6767,21386,697723,4186162,31102351
%N A153689 Greatest number m such that the fractional part of (11/10)^A153685(n) <= 1/m.
%F A153689 a(n) = floor(1/fract((11/10)^A153685(n))), where fract(x) = x-floor(x).
%e A153689 a(2)=18 since 1/19 < fract((11/10)^A153685(2)) = fract((11/10)^17) = 0.0544... <= 1/18.
%t A153689 A153685 = {1, 17, 37, 237, 599, 615, 6638, 13885, 1063942, 9479731};
%t A153689 Table[fp = FractionalPart[(11/10)^A153685[[n]]]; m = Floor[1/fp];
%t A153689 While[fp <= 1/m, m++]; m - 1, {n, 1, Length[A153685]}] (* _Robert Price_, Mar 25 2019 *)
%Y A153689 Cf. A081464, A153669, A153677, A153685, A154130, A153697, A153705, A153713, A153721.
%K A153689 nonn,more
%O A153689 1,1
%A A153689 _Hieronymus Fischer_, Jan 06 2009
%E A153689 a(9)-a(10) from _Robert Price_, Mar 25 2019