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.

A153721 Greatest number m such that the fractional part of (Pi-2)^A153717(n) <= 1/m.

Original entry on oeis.org

7, 7, 38, 318, 393, 396, 484, 2076, 2619, 4099, 5264, 8556, 18070, 20732, 27209, 73351, 356362
Offset: 1

Views

Author

Hieronymus Fischer, Jan 06 2009

Keywords

Examples

			a(3)=38 since 1/39<fract((Pi-2)^A153717(3))=fract((Pi-2)^23)=0.02600...<=1/38.
		

Crossrefs

Programs

  • Mathematica
    A153717 = {1, 20, 23, 24, 523, 2811, 3465, 3776, 4567, 6145, 8507, 9353, 19790, 41136, 62097, 72506, 107346};
    Table[fp = FractionalPart[(Pi - 2)^A153717[[n]]]; m = Floor[1/fp];
    While[fp <= 1/m, m++]; m - 1, {n, 1, Length[A153717]}] (* Robert Price, Mar 26 2019 *)

Formula

a(n) = floor(1/fract((Pi-2)^A153717(n))), where fract(x) = x-floor(x).