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 A153723 #10 Apr 18 2019 11:41:28
%S A153723 1,1,1,3,16,24,45,158,410,946,1182,8786,16159,20188,61392,78800,78959,
%T A153723 217556
%N A153723 Greatest number m such that the fractional part of (Pi-2)^A153719(m) >= 1-(1/m).
%F A153723 a(n) = floor(1/(1-fract((Pi-2)^A153719(n)))), where fract(x) = x-floor(x).
%e A153723 a(5) = 16, since 1-(1/17) = 0.941176... > fract((Pi-2)^A153719(5)) = fract((Pi-2)^5) = 0.9389... >= 0.9375 = 1-(1/16).
%t A153723 $MaxExtraPrecision = 100000;
%t A153723 A153719 = {1, 2, 3, 4, 5, 39, 56, 85, 557, 911, 2919, 2921, 4491,
%t A153723 11543, 15724, 98040, 110932, 126659};
%t A153723 Floor[1/(1 - FractionalPart[(Pi - 2)^A153719])] (* _Robert Price_, Apr 18 2019 *)
%Y A153723 Cf. A153663, A153671, A153679, A153687, A153695, A091560, A153711, A153719, A154130.
%K A153723 nonn,more
%O A153723 1,4
%A A153723 _Hieronymus Fischer_, Jan 06 2009