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.

A153697 Greatest number m such that the fractional part of (10/9)^A153693(n) <= 1/m.

Original entry on oeis.org

9, 11, 30, 82, 6131, 26735, 29430, 76172, 151439, 227416, 771341, 2712159, 4490404
Offset: 1

Views

Author

Hieronymus Fischer, Jan 06 2009

Keywords

Examples

			a(2)=11 since 1/12 < fract((10/9)^A153693(2)) = fract((10/9)^7) = 0.09075... <= 1/11.
		

Crossrefs

Programs

  • 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 *)

Formula

a(n) = floor(1/fract((10/9)^A153693(n))), where fract(x) = x-floor(x).

Extensions

a(12)-a(13) from Robert Price, Mar 25 2019