|
Search: id:A124909
|
|
|
| A124909 |
|
a(n) = least integer j>=0 such that n=Floor[(4^j)/(3^k)] for some integer k>=0. |
|
+0
2
|
|
| 0, 3, 4, 1, 2, 14, 3, 15, 4, 12, 16, 5, 9, 13, 21, 2, 10, 14, 18, 22, 3, 7, 11, 15, 38, 19, 23, 4, 8, 31, 12, 35, 16, 39, 20, 24, 5, 28, 9, 32, 97, 13, 36, 17, 40, 21, 44, 151, 25, 6, 29, 136, 10, 33, 98, 14, 37, 102, 18, 41, 148, 22, 45, 3, 26, 175, 7, 72, 30, 53, 11, 34, 267, 15
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The k-sequence is A124917.
|
|
EXAMPLE
|
1=[4^0/3^0], 2=[4^3/3^3], 3=[4^4/3^4], 4=[4^1/3^0],...,
so j-sequence=(0,3,4,1,...); k-sequence=(0,3,4,0,...).
|
|
CROSSREFS
|
Cf. A124917.
Adjacent sequences: A124906 A124907 A124908 this_sequence A124910 A124911 A124912
Sequence in context: A076942 A021971 A021297 this_sequence A090279 A101667 A117378
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Nov 13 2006
|
|
|
Search completed in 0.002 seconds
|
