|
Search: id:A153677
|
|
|
| A153677 |
|
Minimal exponents m such that the fractional part of (1024/1000)^m obtains a minimum (when starting with m=1). |
|
+0
13
|
|
| 1, 68, 142, 341, 395, 490, 585, 1164, 1707, 26366, 41358, 46074, 120805, 147332, 184259, 205661, 385710
(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 (1024/1000)^m is less than
the
fractional
part of (1024/1000)^k for all k, 1<=k<m.
The next such number must be greater than 5*10^5.
|
|
FORMULA
|
Recursion: a(1):=1, a(k):=min{ m>1 | fract((1024/1000)^m) < fract((1024/1000)^a(k-1))}, where fract(x) = x-floor(x).
|
|
EXAMPLE
|
a(2)=68, since fract((1024/1000)^68)=0.016456.., but fract((1024/1000)^k)>=0.024 for 1<=k<=67; thus
fract((1024/1000)^68)<fract((1024/1000)^k) for 1<=k<68.
|
|
CROSSREFS
|
Cf. A153661, A153669, A153681, A154130, A153685, A153693, A153701, A153709, A153717.
Sequence in context: A111379 A044191 A044572 this_sequence A044319 A044700 A063341
Adjacent sequences: A153674 A153675 A153676 this_sequence A153678 A153679 A153680
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jan 06 2009
|
|
|
Search completed in 0.002 seconds
|
