|
Search: id:A124905
|
|
|
| A124905 |
|
a(n) = least integer j>=0 such that n=Floor[(3^j)/(4^k)] for some integer k>=0. |
|
+0
2
|
|
| 0, 2, 1, 9, 4, 3, 17, 7, 2, 11, 6, 20, 15, 10, 5, 24, 19, 14, 9, 4, 23, 47, 18, 13, 8, 32, 3, 51, 22, 17, 41, 12, 36, 7, 31, 26, 79, 21, 74, 45, 16, 40, 11, 35, 6, 30, 136, 54, 25, 49, 20, 73, 44, 15, 174, 39, 10, 169, 34, 5, 111, 29, 294, 53, 24, 130, 48, 260, 19, 284, 43, 14, 67
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The k-sequence is A124913.
|
|
EXAMPLE
|
1=[3^0/4^0], 2=[3^2/4^1], 3=[3^1/4^0], 4=[3^9/4^6],...,
so j-sequence=(0,2,1,9,...); k-sequence=(0,1,0,6,...).
|
|
CROSSREFS
|
Cf. A124913.
Sequence in context: A095888 A124776 A099285 this_sequence A021086 A011136 A067304
Adjacent sequences: A124902 A124903 A124904 this_sequence A124906 A124907 A124908
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Nov 12 2006
|
|
|
Search completed in 0.002 seconds
|
