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 A153724 #7 May 10 2019 16:48:59
%S A153724 1,16,8,158,946,8786,16159,20188,61392,34039,31425,59154,217556
%N A153724 Greatest number m such that the fractional part of (Pi-2)^A153720(n) >= 1-(1/m).
%F A153724 a(n):=floor(1/(1-fract((Pi-2)^A153720(n)))), where fract(x) = x-floor(x).
%e A153724 a(4)=158, since 1-(1/159) = 0.993710... > fract((Pi-2)^A153720(4)) = fract(Pi^85) = 0.993693... >= 0.993670... = 1-(1/158).
%t A153724 A153720 = {1, 5, 8, 85, 911, 2921, 4491, 11543, 15724, 27683, 29921,
%t A153724 37276, 126659};
%t A153724 Table[Floor[1/(1 - FractionalPart[(Pi - 2)^A153720[[n]]])], {n, 1,
%t A153724 Length[A153720]}] (* _Robert Price_, May 10 2019 *)
%Y A153724 Cf. A153664, A153672, A153680, A153688, A153696, A153704, A153712, A153720, A154130.
%K A153724 nonn,more
%O A153724 1,2
%A A153724 _Hieronymus Fischer_, Jan 06 2009