login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A153707 Greatest number m such that the fractional part of e^A091560(m) >= 1-(1/m). 8
3, 23, 27, 41, 59, 261, 348, 2720, 3198, 6064, 72944, 347065 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..12.

FORMULA

a(n):=floor(1/(1-fract(e^A091560(n)))), where fract(x) = x-floor(x).

EXAMPLE

a(2)=23, since 1-(1/24) = 0.9583...> fract(e^A091560(2)) = fract(e^8) = 0.95798.. >= 0.95652... >= 1-(1/23).

MATHEMATICA

$MaxExtraPrecision = 100000;

A091560 = {1, 8, 19, 76, 166, 178, 209, 1907, 20926, 22925, 32653, 119136};

Floor[1/(1-FractionalPart[E^A091560])] (* Robert Price, Apr 18 2019 *)

CROSSREFS

Cf. A153663, A153671, A153679, A153687, A153695, A154130, A153715, A153723.

Cf. A000149.

Sequence in context: A124076 A153834 A323010 * A232327 A153708 A103361

Adjacent sequences:  A153704 A153705 A153706 * A153708 A153709 A153710

KEYWORD

nonn,more

AUTHOR

Hieronymus Fischer, Jan 06 2009

EXTENSIONS

a(12) from Robert Price, Apr 18 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 5 10:45 EST 2019. Contains 329751 sequences. (Running on oeis4.)