|
Search: id:A124915
|
|
|
| A124915 |
|
a(n) = least integer k>=0 such that n=Floor[(2^j)/(3^k)] for some integer j>=0. |
|
+0
2
|
|
| 0, 0, 2, 0, 1, 4, 2, 0, 3, 1, 6, 4, 9, 2, 12, 0, 10, 3, 8, 25, 1, 6, 11, 16, 4, 9, 26, 2, 7, 36, 12, 0, 5, 34, 10, 27, 3, 32, 8, 37, 25, 1, 30, 6, 47, 23, 11, 40, 16, 4, 33, 21, 9, 38, 26, 2, 43, 31, 7, 48, 36, 24, 12, 0, 29, 17, 5, 46, 34, 22, 10, 39, 27, 15, 3, 44, 32, 20, 8, 49
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Every nonnegative integer occurs infinitely many times. The j-sequence is A124907.
|
|
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. A124907.
Adjacent sequences: A124912 A124913 A124914 this_sequence A124916 A124917 A124918
Sequence in context: A108643 A133838 A121583 this_sequence A030188 A124912 A138752
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Nov 12 2006
|
|
|
Search completed in 0.002 seconds
|
