|
| |
|
|
A153711
|
|
Minimal exponents m such that the fractional part of pi^m obtains a maximum (when starting with m=1).
|
|
8
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Recursive definition: a(1)=1, a(n) = least number m>a(n-1) such that the fractional part of pi^m is greater than the
fractional part of pi^k for all k, 1<=k<m.
The next such number must be greater than 100000.
|
|
|
FORMULA
| Recursion: a(1):=1, a(k):=min{ m>1 | fract(pi^m) > fract(pi^a(k-1))}, where fract(x) = x-floor(x).
|
|
|
EXAMPLE
| a(3)=15, since fract(pi^15)= 0.9693879984..., but fract(pi^k)<=0.8696... for 1<=k<=14;
thus fract(pi^15)>fract(pi^k) for 1<=k<15 and 15 is the minimal exponent > 2 with this property.
|
|
|
CROSSREFS
| Cf. A153663, A153671, A153679, A153687, A153695, A153707, A153715, A154130, A153719.
Cf. A001672.
Sequence in context: A198391 A075722 A153712 * A116049 A184236 A023651
Adjacent sequences: A153708 A153709 A153710 * A153712 A153713 A153714
|
|
|
KEYWORD
| nonn,more
|
|
|
AUTHOR
| Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jan 06 2009
|
| |
|
|
