|
Search: id:A153663
|
|
|
| A153663 |
|
Minimal exponents m such that the fractional part of (3/2)^m reaches a maximum (when starting with m=1). |
|
+0
23
|
|
| 1, 5, 8, 10, 12, 14, 46, 58, 105, 157, 163, 455, 1060, 1256, 2677, 8093, 28277, 33327, 49304, 158643, 164000
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Recursive definition: a(1)=1, a(n) = least number m such that the fractional part of (3/2)^m is greater than the
fractional part of (3/2)^k for all k, 1<=k<m.
The next such number must be greater than 305000.
|
|
FORMULA
|
Recursion: a(1):=1, a(k):=min{ m>1 | fract((3/2)^m) > fract((3/2)^a(k-1))}, where fract(x) = x-floor(x).
|
|
EXAMPLE
|
a(2)=5, since fract((3/2)^5)=0.59375, but fract((3/2)^k)=0.5, 0.25, 0.375, 0.0625 for 1<=k<=4; thus
fract((3/2)^5)>fract((3/2)^k) for 1<=k<5.
|
|
CROSSREFS
|
Cf. A002379, A153661, A153662, A153664, A153665, A153666, A153667, A153668.
Sequence in context: A049195 A064362 A115401 this_sequence A065528 A050936 A084146
Adjacent sequences: A153660 A153661 A153662 this_sequence A153664 A153665 A153666
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Dec 31 2008
|
|
|
Search completed in 0.002 seconds
|
