# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a153697
Showing 1-1 of 1

%I A153697 #14 Mar 26 2019 11:46:44
%S A153697 9,11,30,82,6131,26735,29430,76172,151439,227416,771341,2712159,
%T A153697 4490404
%N A153697 Greatest number m such that the fractional part of (10/9)^A153693(n) <= 1/m.
%F A153697 a(n) = floor(1/fract((10/9)^A153693(n))), where fract(x) = x-floor(x).
%e A153697 a(2)=11 since 1/12 < fract((10/9)^A153693(2)) = fract((10/9)^7) = 0.09075... <= 1/11.
%t A153697 A153693 = {1, 7, 50, 62, 324, 3566, 66877, 108201, 123956, 132891,
%t A153697    182098, 566593, 3501843};
%t A153697 Table[fp = FractionalPart[(10/9)^A153693[[n]]]; m = Floor[1/fp];
%t A153697 While[fp <= 1/m, m++]; m - 1, {n, 1, Length[A153693]}] (* _Robert Price_, Mar 25 2019 *)
%Y A153697 Cf. A081464, A153669, A153677, A153685, A153693, A154130, A153705, A153713, A153721.
%K A153697 nonn,more
%O A153697 1,1
%A A153697 _Hieronymus Fischer_, Jan 06 2009
%E A153697 a(12)-a(13) from _Robert Price_, Mar 25 2019

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE