login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A137994 a(n) is the smallest integer > a(n-1) such that {Pi^a(n)} < {Pi^a(n-1)}, where {x} = x - floor(x), a(1)=1. 12
1, 3, 81, 264, 281, 472, 1147, 2081, 3207, 3592, 10479, 12128, 65875, 114791, 118885 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
The sequence was suggested by Leroy Quet on Pi day 2008, cf. A138324.
The next such number must be greater than 100000. [Hieronymus Fischer, Jan 06 2009]
a(16) > 300,000. - Robert Price, Mar 25 2019
LINKS
EXAMPLE
a(3)=81, since fract((Pi^81)=0.0037011283.., but fract(Pi^k)>=0.0062766802... for 1<=k<=80; thus fract(Pi^81)<fract(Pi^k) for 1<=k<81. [Hieronymus Fischer, Jan 06 2009]
MATHEMATICA
$MaxExtraPrecision = 10000;
p = .999;
Select[Range[1, 5000],
If[FractionalPart[Pi^#] < p, p = FractionalPart[Pi^#]; True] &] (* Robert Price, Mar 12 2019 *)
PROG
(PARI) default(realprecision, 10^4); print1(a=1); for(i=1, 100, f=frac(Pi^a); until( frac(Pi^a++)<f, ); print1(", "a))
CROSSREFS
Sequence in context: A251694 A355626 A274567 * A074386 A116009 A068562
KEYWORD
nonn,more
AUTHOR
Leroy Quet and M. F. Hasler, Mar 14 2008
EXTENSIONS
a(11)-a(13) from Hieronymus Fischer, Jan 06 2009
Edited by R. J. Mathar, May 21 2010
a(14)-a(15) from Robert Price, Mar 12 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 25 05:51 EDT 2024. Contains 374586 sequences. (Running on oeis4.)