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!)
 A153685 Minimal exponents m such that the fractional part of (11/10)^m obtains a minimum (when starting with m=1). 11
 1, 17, 37, 237, 599, 615, 6638, 13885, 1063942, 9479731 (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 (11/10)^m is less than the fractional part of (11/10)^k for all k, 1<=k 10^7. Robert Price, Mar 19 2019 LINKS FORMULA Recursion: a(1):=1, a(k):=min{ m>1 | fract((11/10)^m) < fract((11/10)^a(k-1))}, where fract(x) = x-floor(x). EXAMPLE a(2)=17, since fract((11/10)^17)=0.05447.., but fract((11/10)^k)>=0.1 for 1<=k<=16; thus fract((11/10)^17)

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 June 24 17:34 EDT 2021. Contains 345418 sequences. (Running on oeis4.)