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 A153715 #11 Apr 18 2019 11:42:05
%S A153715 1,7,32,53,189,2665,10810,26577,128778,483367
%N A153715 Greatest number m such that the fractional part of Pi^A153711(m) >= 1-(1/m).
%F A153715 a(n) = floor(1/(1-fract(Pi^A153711(n)))), where fract(x) = x-floor(x).
%e A153715 a(3) = 32, since 1-(1/33) = 0.9696... > fract(Pi^A153711(3)) = fract(Pi^15) = 0.96938... >= 0.96875 = 1-(1/32).
%t A153715 $MaxExtraPrecision = 100000;
%t A153715 A153711 = {1, 2, 15, 22, 58, 157, 1030, 5269, 145048, 151710};
%t A153715 Floor[1/(1-FractionalPart[Pi^A153711])] (* _Robert Price_, Apr 18 2019 *)
%Y A153715 Cf. A153663, A153671, A153679, A153687, A153695, A091560, A153711, A154130, A153723.
%Y A153715 Cf. A001672.
%K A153715 nonn,more
%O A153715 1,2
%A A153715 _Hieronymus Fischer_, Jan 06 2009
%E A153715 a(9)-a(10) from _Robert Price_, Apr 18 2019