%I A153679
%S A153679 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,
%T A153679 27,28,29,82,134,1306,2036,6393,34477,145984
%N A153679 Minimal exponents m such that the fractional part of (1024/1000)^m obtains 
               a maximum (when starting with m=1).
%C A153679 Recursive definition: a(1)=1, a(n) = least number m>a(n-1) such that 
               the fractional part of (1024/1000)^m is greater than
%C A153679 the
%C A153679 fractional part of (1024/1000)^k for all k, 1<=k<m.
%C A153679 The next such number must be greater than 5*10^5.
%F A153679 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).
%e A153679 a(30)=82, since fract((1024/1000)^82)= 0.99191990..., but fract((1024/
               1000)^k)<0.9893 for 1<=k<=81;
%e A153679 thus fract((1024/1000)^82)>fract((1024/1000)^k) for 1<=k<82 and 82 is 
               the minimal exponent >29 with this property.
%Y A153679 Cf. A153663, A153671, A153675, A154130, A153687, A153695, A153703, A153711, 
               A153719.
%Y A153679 Sequence in context: A004441 A004438 A109425 this_sequence A160546 A087143 
               A080683
%Y A153679 Adjacent sequences: A153676 A153677 A153678 this_sequence A153680 A153681 
               A153682
%K A153679 nonn,more
%O A153679 1,2
%A A153679 Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jan 06 2009