The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A153697 Greatest number m such that the fractional part of (10/9)^A153693(n) <= 1/m. 4
 9, 11, 30, 82, 6131, 26735, 29430, 76172, 151439, 227416, 771341, 2712159, 4490404 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n) = floor(1/fract((10/9)^A153693(n))), where fract(x) = x-floor(x). EXAMPLE a(2)=11 since 1/12 < fract((10/9)^A153693(2)) = fract((10/9)^7) = 0.09075... <= 1/11. MATHEMATICA A153693 = {1, 7, 50, 62, 324, 3566, 66877, 108201, 123956, 132891, 182098, 566593, 3501843}; Table[fp = FractionalPart[(10/9)^A153693[[n]]]; m = Floor[1/fp]; While[fp <= 1/m, m++]; m - 1, {n, 1, Length[A153693]}] (* Robert Price, Mar 25 2019 *) CROSSREFS Cf. A081464, A153669, A153677, A153685, A153693, A154130, A153705, A153713, A153721. Sequence in context: A233402 A276406 A130730 * A129399 A145790 A345109 Adjacent sequences: A153694 A153695 A153696 * A153698 A153699 A153700 KEYWORD nonn,more AUTHOR Hieronymus Fischer, Jan 06 2009 EXTENSIONS a(12)-a(13) from Robert Price, Mar 25 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 29 17:20 EST 2023. Contains 359923 sequences. (Running on oeis4.)