|
Search: id:A153695
|
|
|
| A153695 |
|
Minimal exponents m such that the fractional part of (10/9)^m obtains a maximum (when starting with m=1). |
|
+0
11
|
|
| 1, 2, 3, 4, 5, 6, 13, 17, 413, 555, 2739, 3509, 3869, 5513, 12746, 31808, 76191, 126237
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Recursive definition: a(1)=1, a(n) = least number m>a(n-1) such that the fractional part of (10/9)^m is greater than the
fractional part of (10/9)^k for all k, 1<=k<m.
The next such number must be greater than 2*10^5.
|
|
FORMULA
|
Recursion: a(1):=1, a(k):=min{ m>1 | fract((10/9)^m) > fract((10/9)^a(k-1))}, where fract(x) = x-floor(x).
|
|
EXAMPLE
|
a(7)=13, since fract((10/9)^13)= 0.93..., but fract((10/9)^k)<0.89 for 1<=k<=12;
thus fract((10/9)^13)>fract((10/9)^k) for 1<=k<13 and 13 is the minimal exponent > 6 with this property.
|
|
CROSSREFS
|
Cf. A153663, A153671, A153679, A153687, A153699, A154130, A153703, A153711, A153719.
Sequence in context: A115307 A086185 A057224 this_sequence A121433 A010349 A032995
Adjacent sequences: A153692 A153693 A153694 this_sequence A153696 A153697 A153698
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jan 06 2009
|
|
|
Search completed in 0.002 seconds
|
