|
Search: id:A124917
|
|
|
| A124917 |
|
a(n) = least integer k>=0 such that n=Floor[(4^j)/(3^k)] for some integer j>=0. |
|
+0
2
|
|
| 0, 3, 4, 0, 1, 16, 2, 17, 3, 13, 18, 4, 9, 14, 24, 0, 10, 15, 20, 25, 1, 6, 11, 16, 45, 21, 26, 2, 7, 36, 12, 41, 17, 46, 22, 27, 3, 32, 8, 37, 119, 13, 42, 18, 47, 23, 52, 187, 28, 4, 33, 168, 9, 38, 120, 14, 43, 125, 19, 48, 183, 24, 53, 0, 29, 217, 5, 87, 34, 63, 10, 39, 333, 15
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Every nonnegative integer occurs infinitely many times. The j-sequence is A124909.
|
|
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. A124908.
Sequence in context: A021298 A073234 A123685 this_sequence A025278 A063405 A139401
Adjacent sequences: A124914 A124915 A124916 this_sequence A124918 A124919 A124920
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Nov 13 2006
|
|
|
Search completed in 0.002 seconds
|
