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 A153722 #9 May 11 2019 01:44:36
%S A153722 7,3,38,318,78,83,265,185,73351,356362
%N A153722 Greatest number m such that the fractional part of (Pi-2)^A153718(n) <= 1/m.
%F A153722 a(n) = floor(1/fract((Pi-2)^A153718(n))), where fract(x) = x-floor(x).
%e A153722 a(3) = 38 since 1/39 < fract((Pi-2)^A153718(3)) = fract((Pi-2)^23) = 0.02600... <= 1/38.
%t A153722 A153718 = {1, 2, 23, 24, 35, 41, 65, 182, 72506, 107346};
%t A153722 Table[Floor[1/FractionalPart[(Pi - 2)^A153718[[n]]]], {n, 1,
%t A153722 Length[A153718]}] (* _Robert Price_, May 10 2019 *)
%Y A153722 Cf. A153662, A153670, A153678, A153686, A153694, A153702, A153710, A153718, A154130.
%K A153722 nonn,more
%O A153722 1,1
%A A153722 _Hieronymus Fischer_, Jan 06 2009