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 A153673 #11 Mar 26 2019 11:46:21
%S A153673 100,147,703,932,1172,3389,7089,8767,11155,17457,20810,25355,1129226,
%T A153673 1741049,1960780,2179637,2859688,11014240,75249086,132665447,499298451
%N A153673 Greatest number m such that the fractional part of (101/100)^A153669(n) <= 1/m.
%F A153673 a(n) = floor(1/fract((101/100)^A153669(n))), where fract(x) = x-floor(x).
%e A153673 a(2)=147 since 1/148<fract((101/100)^A153669(2))=fract((101/100)^70)=0.00676...<=1/147.
%t A153673 A153669 = {1, 70, 209, 378, 1653, 2697, 4806, 13744, 66919, 67873,
%t A153673 75666, 81125, 173389, 529938, 1572706, 4751419, 7159431, 7840546,
%t A153673 15896994, 71074288, 119325567};
%t A153673 Table[fp = FractionalPart[(101/100)^A153669[[n]]]; m = Floor[1/fp];
%t A153673 While[fp <= 1/m, m++]; m - 1, {n, 1, Length[A153669]}] (* _Robert Price_, Mar 25 2019 *)
%Y A153673 Cf. A154130, A153669, A153665, A153681, A153689, A153697, A153705, A153713, A153721.
%K A153673 nonn,more
%O A153673 1,1
%A A153673 _Hieronymus Fischer_, Jan 06 2009
%E A153673 a(15)-a(21) from _Robert Price_, Mar 25 2019