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 A153713 #10 Mar 26 2019 15:55:34
%S A153713 7,159,270,307,744,757,796,1079,1226,7804,13876,62099,70718,86902,
%T A153713 154755
%N A153713 Greatest number m such that the fractional part of Pi^A137994(n) <= 1/m.
%F A153713 a(n) = floor(1/fract(Pi^A137994(n))), where fract(x) = x-floor(x).
%e A153713 a(2)=159 since 1/160<fract(Pi^A137994(2))=fract(Pi^3)=0.0062766...<=1/159.
%t A153713 A137994 = {1, 3, 81, 264, 281, 472, 1147, 2081, 3207, 3592, 10479, 12128, 65875, 114791, 118885};
%t A153713 Table[fp = FractionalPart[Pi^A137994[[n]]]; m = Floor[1/fp];
%t A153713 While[fp <= 1/m, m++]; m - 1, {n, 1, Length[A137994]}] (* _Robert Price_, Mar 26 2019 *)
%Y A153713 Cf. A081464, A153669, A153677, A153685, A153693, A153701, A137994, A154130, A153721.
%Y A153713 Cf. A001672.
%K A153713 nonn,more
%O A153713 1,1
%A A153713 _Hieronymus Fischer_, Jan 06 2009
%E A153713 a(14)-a(15) from _Robert Price_, Mar 26 2019