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 A153716 #10 May 11 2019 01:44:41
%S A153716 1,7,32,53,189,131,2665,10810,2693,1976,3697,4289,26577,483367
%N A153716 Greatest number m such that the fractional part of Pi^A153712(n) >= 1-(1/m).
%F A153716 a(n) = floor(1/(1-fract(Pi^A153712(n)))), where fract(x) = x-floor(x).
%e A153716 a(3) = 32, since 1-(1/33) = 0.9696... > fract(Pi^A153712(3)) = fract(Pi^15) = 0.96938... >= 0.96875 = 1-(1/32).
%t A153716 A153712 = {1, 2, 15, 22, 58, 109, 157, 1030, 1071, 1274, 2008, 2322,
%t A153716 5269, 151710};
%t A153716 Table[Floor[1/(1 - FractionalPart[Pi^A153712[[n]]])], {n, 1,
%t A153716 Length[A153712]}] (* _Robert Price_, May 10 2019 *)
%Y A153716 Cf. A153664, A153672, A153680, A153688, A153696, A153704, A153712, A154130, A153724.
%Y A153716 Cf. A001672.
%K A153716 nonn,more
%O A153716 1,2
%A A153716 _Hieronymus Fischer_, Jan 06 2009
%E A153716 a(14) from _Robert Price_, May 10 2019