The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A153724 Greatest number m such that the fractional part of (Pi-2)^A153720(n) >= 1-(1/m). 7
 1, 16, 8, 158, 946, 8786, 16159, 20188, 61392, 34039, 31425, 59154, 217556 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Table of n, a(n) for n=1..13. FORMULA a(n):=floor(1/(1-fract((Pi-2)^A153720(n)))), where fract(x) = x-floor(x). EXAMPLE a(4)=158, since 1-(1/159) = 0.993710... > fract((Pi-2)^A153720(4)) = fract(Pi^85) = 0.993693... >= 0.993670... = 1-(1/158). MATHEMATICA A153720 = {1, 5, 8, 85, 911, 2921, 4491, 11543, 15724, 27683, 29921, 37276, 126659}; Table[Floor[1/(1 - FractionalPart[(Pi - 2)^A153720[[n]]])], {n, 1, Length[A153720]}] (* Robert Price, May 10 2019 *) CROSSREFS Cf. A153664, A153672, A153680, A153688, A153696, A153704, A153712, A153720, A154130. Sequence in context: A299584 A213558 A164703 * A183396 A070535 A070579 Adjacent sequences: A153721 A153722 A153723 * A153725 A153726 A153727 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 13 02:32 EDT 2024. Contains 373366 sequences. (Running on oeis4.)