|
| |
|
|
A153719
|
|
Minimal exponents m such that the fractional part of (pi-2)^m obtains a maximum (when starting with m=1).
|
|
7
| |
|
|
1, 2, 3, 4, 5, 39, 56, 85, 557, 911, 2919, 2921, 4491, 11543, 15724, 98040, 110932, 126659
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Recursive definition: a(1)=1, a(n) = least number m>a(n-1) such that the fractional part of (pi-2)^m is greater than the
fractional part of (pi-2)^k for all k, 1<=k<m.
The next such number must be greater than 200000.
|
|
|
FORMULA
| Recursion: a(1):=1, a(k):=min{ m>1 | fract((pi-2)^m) > fract((pi-2)^a(k-1))}, where fract(x) = x-floor(x).
|
|
|
EXAMPLE
| a(6)=39, since fract((pi-2)^39)= 0.9586616565..., but fract((pi-2)^k)<=0.9389018... for 1<=k<=38;
thus fract((pi-2)^39)>fract((pi-2)^k) for 1<=k<39 and 39 is the minimal exponent > 5 with this property.
|
|
|
CROSSREFS
| Cf. A153663, A153671, A153679, A153687, A153695, A153707, A153715, A153723, A154130.
Sequence in context: A043310 A171578 A044907 * A024637 A037328 A028427
Adjacent sequences: A153716 A153717 A153718 * A153720 A153721 A153722
|
|
|
KEYWORD
| nonn,more
|
|
|
AUTHOR
| Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Jan 06 2009
|
| |
|
|
