The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A153723 Greatest number m such that the fractional part of (Pi-2)^A153719(m) >= 1-(1/m). 8
 1, 1, 1, 3, 16, 24, 45, 158, 410, 946, 1182, 8786, 16159, 20188, 61392, 78800, 78959, 217556 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS FORMULA a(n) = floor(1/(1-fract((Pi-2)^A153719(n)))), where fract(x) = x-floor(x). EXAMPLE 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). MATHEMATICA \$MaxExtraPrecision = 100000; A153719 = {1, 2, 3, 4, 5, 39, 56, 85, 557, 911, 2919, 2921, 4491,    11543, 15724, 98040, 110932, 126659}; Floor[1/(1 - FractionalPart[(Pi - 2)^A153719])] (* Robert Price, Apr 18 2019 *) CROSSREFS Cf. A153663, A153671, A153679, A153687, A153695, A091560, A153711, A153719, A154130. Sequence in context: A028687 A201274 A101132 * A091273 A256931 A101405 Adjacent sequences:  A153720 A153721 A153722 * A153724 A153725 A153726 KEYWORD nonn,more AUTHOR Hieronymus Fischer, Jan 06 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 5 06:34 EDT 2021. Contains 346458 sequences. (Running on oeis4.)