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 A153714 #10 Mar 03 2020 06:56:47
%S A153714 7,159,50,10,21,55,117,270,307,744,757,7804,13876,62099,70718,154755
%N A153714 Greatest number m such that the fractional part of Pi^A153710(n) <= 1/m.
%F A153714 a(n) = floor(1/fract(Pi^A153710(n))), where fract(x) = x-floor(x).
%e A153714 a(2)=159 since 1/160<fract(Pi^A153710(2))=fract(Pi^3)=0.0062766...<=1/159.
%t A153714 A153710 = {1, 3, 5, 9, 10, 11, 59, 81, 264, 281, 472, 3592, 10479,
%t A153714 12128, 65875, 118885};
%t A153714 Table[fp = FractionalPart[Pi^A153710[[n]]]; m = Floor[1/fp];
%t A153714 While[fp <= 1/m, m++]; m - 1, {n, 1, Length[A153710]}] (* _Robert Price_, May 10 2019 *)
%Y A153714 Cf. A153662, A153670, A153678, A153686, A153694, A153702, A153710, A154130, A153722.
%Y A153714 Cf. A001672.
%K A153714 nonn,more
%O A153714 1,1
%A A153714 _Hieronymus Fischer_, Jan 06 2009
%E A153714 a(16) from _Robert Price_, May 10 2019