cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A153705 Greatest number m such that the fractional part of e^A153701(n) <= 1/m.

Original entry on oeis.org

1, 2, 11, 11, 23, 28, 69, 85, 115, 964, 1153, 1292, 1296, 1877, 34015, 156075, 952945
Offset: 1

Views

Author

Hieronymus Fischer, Jan 06 2009

Keywords

Examples

			a(3)=11 since 1/12 < fract(e^A153701(3)) = fract(e^3) = 0.0855... <= 1/11.
		

Crossrefs

Programs

  • Mathematica
    A153701 = {1, 2, 3, 9, 29, 45, 75, 135, 219, 732, 1351, 3315, 4795,
       4920, 5469, 28414, 37373};
    Table[fp = FractionalPart[E^A153701[[n]]]; m = Floor[1/fp];
    While[fp <= 1/m, m++]; m - 1, {n, 1, Length[A153701]}] (* Robert Price, Mar 25 2019 *)

Formula

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