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.

Previous Showing 11-12 of 12 results.

A153699 Greatest number m such that the fractional part of (10/9)^A153695(m) >= 1-(1/m).

Original entry on oeis.org

1, 1, 1, 2, 3, 8, 15, 264, 334, 465, 683, 713, 758, 8741, 15912, 18920, 38560, 409895
Offset: 1

Views

Author

Hieronymus Fischer, Jan 06 2009

Keywords

Examples

			a(7)=15, since 1-(1/16)=0.9375>fract((10/9)^A153695(7))=fract((10/9)^13)=0.9341...>=1-(1/15).

Crossrefs

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

Formula

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

A153691 Greatest number m such that the fractional part of (11/10)^A153687(m) >= 1-(1/m).

Original entry on oeis.org

1, 1, 1, 1, 2, 4, 19, 21, 28, 151, 200, 709, 767, 5727, 15908, 162819, 302991
Offset: 1

Views

Author

Hieronymus Fischer, Jan 06 2009

Keywords

Examples

			a(6)=4, since 1-(1/5)=0.8>fract((11/10)^A153687(6))=fract((11/10)^6)=0.771...>=1-(1/4).

Crossrefs

Cf. A153663, A153671, A153679, A153683, A154130, A153699, A153707, A153715, A153723.

Formula

a(n):=floor(1/(1-fract((11/10)^A153687(n)))), where fract(x) = x-floor(x).
Previous Showing 11-12 of 12 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.