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 A153681 #11 Mar 26 2019 11:46:29
%S A153681 41,60,76,116,233,463,718,1350,12472,13733,17428,27955,32276,41155,
%T A153681 62437,69643,111085,811799,2656810,11462221,56414953
%N A153681 Greatest number m such that the fractional part of (1024/1000)^A153677(n) <= 1/m.
%F A153681 a(n) = floor(1/fract((1024/1000)^A153677(n))), where fract(x) = x-floor(x).
%e A153681 a(2)=60 since 1/61 < fract((1024/1000)^A153677(2)) = fract((1024/1000)^68) = 0.0164... <= 1/60.
%t A153681 A153677 = {1, 68, 142, 341, 395, 490, 585, 1164, 1707, 26366, 41358,
%t A153681 46074, 120805, 147332, 184259, 205661, 385710, 522271, 3418770,
%t A153681 3675376, 9424094};
%t A153681 Table[fp = FractionalPart[(1024/1000)^A153677[[n]]]; m = Floor[1/fp];
%t A153681 While[fp <= 1/m, m++]; m - 1, {n, 1, Length[A153677]}] (* _Robert Price_, Mar 25 2019 *)
%Y A153681 Cf. A081464, A153669, A153677, A154130, A153689, A153697, A153705, A153713, A153721.
%K A153681 nonn,more
%O A153681 1,1
%A A153681 _Hieronymus Fischer_, Jan 06 2009
%E A153681 a(18)-a(21) from _Robert Price_, Mar 25 2019