|
Search: id:A153661
|
|
|
| A153661 |
|
Minimal exponents m such that the fractional part of (3/2)^m reaches a minimum (when starting with m=1). |
|
+0
24
|
|
| 1, 2, 4, 29, 95, 153, 532, 613, 840, 2033, 2071, 3328, 12429, 112896, 129638
(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 less than the fractional part of (3/2)^k for all k, 1<=k<m.
The next such number must be greater than 305000.
Apparently a duplicate of A081464. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 07 2009]
|
|
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(3)=4, since fract((3/2)^4)=0.0625, but fract((3/2)^k)=0.5, 0.25, 0.375, for 1<=k<=3; thus fract((3/2)^4)<fract((3/2)^k) for 1<=k<4.
|
|
CROSSREFS
|
A002379, A153662, A153663, A153664, A153665, A153666, A153667, A153668.
Sequence in context: A018291 A033167 A081464 this_sequence A067195 A080230 A084914
Adjacent sequences: A153658 A153659 A153660 this_sequence A153662 A153663 A153664
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
Hieronymus Fischer (Hieronymus.Fischer(AT)gmx.de), Dec 31 2008
|
|
|
Search completed in 0.002 seconds
|
