This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A153687 Minimal exponents m such that the fractional part of (11/10)^m obtains a maximum (when starting with m=1). 11
 1, 2, 3, 4, 5, 6, 7, 23, 56, 77, 103, 320, 1477, 1821, 2992, 15290, 180168, 410498, 548816, 672732, 2601223 (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 greater 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(8)=23, since fract((11/10)^23)= 0.9543..., but fract((11/10)^k)<0.95 for 1<=k<=22; thus fract((11/10)^23)>fract((11/10)^k) for 1<=k<23 and 23 is the minimal exponent > 7 with this property. MATHEMATICA p = 0; Select[Range[1, 50000], If[FractionalPart[(11/10)^#] > p, p = FractionalPart[(11/10)^#]; True] &] (* Robert Price, Mar 19 2019 *) CROSSREFS Cf. A153663, A153671, A153683, A153679, A154130, A153695, A091560, A153711, A153719. Sequence in context: A106275 A303368 A031054 * A142594 A010351 A183530 Adjacent sequences:  A153684 A153685 A153686 * A153688 A153689 A153690 KEYWORD nonn,more AUTHOR Hieronymus Fischer, Jan 06 2009 EXTENSIONS a(18)-a(21) from Robert Price, Mar 19 2019 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 June 16 11:12 EDT 2019. Contains 324152 sequences. (Running on oeis4.)