login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A153715 Greatest number m such that the fractional part of Pi^A153711(m) >= 1-(1/m). 8
1, 7, 32, 53, 189, 2665, 10810, 26577, 128778, 483367 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

FORMULA

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

EXAMPLE

a(3) = 32, since 1-(1/33) = 0.9696... > fract(Pi^A153711(3)) = fract(Pi^15) = 0.96938... >= 0.96875 = 1-(1/32).

MATHEMATICA

$MaxExtraPrecision = 100000;

A153711 = {1, 2, 15, 22, 58, 157, 1030, 5269, 145048, 151710};

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

CROSSREFS

Cf. A153663, A153671, A153679, A153687, A153695, A091560, A153711, A154130, A153723.

Cf. A001672.

Sequence in context: A044465 A029484 A153716 * A060123 A013650 A013656

Adjacent sequences:  A153712 A153713 A153714 * A153716 A153717 A153718

KEYWORD

nonn,more

AUTHOR

Hieronymus Fischer, Jan 06 2009

EXTENSIONS

a(9)-a(10) 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 July 25 03:32 EDT 2021. Contains 346282 sequences. (Running on oeis4.)