|
| |
|
|
A124907
|
|
a(n) = least integer j>=0 such that n=Floor[(2^j)/(3^k)] for some integer k>=0.
|
|
1
| |
|
|
0, 1, 5, 2, 4, 9, 6, 3, 8, 5, 13, 10, 18, 7, 23, 4, 20, 9, 17, 44, 6, 14, 22, 30, 11, 19, 46, 8, 16, 62, 24, 5, 13, 59, 21, 48, 10, 56, 18, 64, 45, 7, 53, 15, 80, 42, 23, 69, 31, 12, 58, 39, 20, 66, 47, 9, 74, 55, 17, 82, 63, 44, 25, 6, 52, 33, 14, 79, 60, 41, 22, 68, 49, 30, 11, 76
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,3
|
|
|
COMMENTS
| The k-sequence is A124915.
|
|
|
EXAMPLE
| 1=[2^0/3^0], 2=[2^1/3^0], 3=[2^5/3^2], 4=[2^2/3^0],...,
so j-sequence=(0,1,5,2,...); k-sequence=(0,0,2,0,...).
|
|
|
CROSSREFS
| Cf. A124915.
Sequence in context: A029683 A063567 A072223 * A181050 A020800 A088507
Adjacent sequences: A124904 A124905 A124906 * A124908 A124909 A124910
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu), Nov 12 2006
|
| |
|
|
