The OEIS is supported by the many generous donors to the OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A153669 Minimal exponents m such that the fractional part of (101/100)^m obtains a minimum (when starting with m=1). 14
 1, 70, 209, 378, 1653, 2697, 4806, 13744, 66919, 67873, 75666, 81125, 173389, 529938, 1572706, 4751419, 7159431, 7840546, 15896994, 71074288, 119325567 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Recursive definition: a(1)=1, a(n) = least number m>a(n-1) such that the fractional part of (101/100)^m is less than the fractional part of (101/100)^k for all k, 1<=k1 | fract((101/100)^m) < fract((101/100)^a(k-1))}, where fract(x) = x-floor(x). EXAMPLE a(2)=70, since fract((101/100)^70)=0.00676..., but fract((101/100)^k)>=0.01 for 1<=k<=69; thus fract((101/100)^70)

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 October 7 05:49 EDT 2022. Contains 357270 sequences. (Running on oeis4.)