The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A153708 Greatest number m such that the fractional part of e^A153704(n) >= 1-(1/m). 7
 3, 23, 27, 261, 348, 2720, 72944, 347065, 244543 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS FORMULA a(n) = floor(1/(1-fract(e^A153704(n)))), where fract(x) = x-floor(x). EXAMPLE a(2) = 23, since 1-(1/24) = 0.9583... > fract(e^A153704(2)) = fract(e^8) = 0.95798... >= 0.95652... >= 1-(1/23). MATHEMATICA A153704 = {1, 8, 19, 178, 209, 1907, 32653, 119136, 220010}; Table[fp = FractionalPart[E^A153704[[n]]]; m = Floor[1/fp]; While[fp >= 1 - (1/m), m++]; m - 1, {n, 1, Length[A153704]}] (* Robert Price, May 10 2019 *) CROSSREFS Cf. A153664, A153672, A153680, A153688, A153696, A153704, A154130, A153716, A153724. Cf. A000149. Sequence in context: A323010 A153707 A232327 * A109218 A103361 A136090 Adjacent sequences:  A153705 A153706 A153707 * A153709 A153710 A153711 KEYWORD nonn,more AUTHOR Hieronymus Fischer, Jan 06 2009 EXTENSIONS a(8)-a(9) from Robert Price, May 10 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified June 19 12:21 EDT 2021. Contains 345128 sequences. (Running on oeis4.)