login
A124912
a(n) = least integer k>=0 such that n=Floor[(3^j)/(2^k)] for some integer j>=0.
1
0, 2, 0, 1, 4, 2, 5, 8, 0, 3, 6, 9, 1, 12, 4, 15, 7, 18, 10, 2, 13, 5, 24, 16, 8, 46, 0, 11, 30, 3, 41, 14, 52, 6, 44, 17, 55, 9, 47, 1, 20, 58, 12, 50, 4, 23, 61, 15, 34, 72, 7, 45, 64, 18, 37, 56, 10, 29, 48, 2, 21, 40, 59, 13, 32, 51, 70, 5, 24, 43, 62, 16, 35, 54, 138, 8, 27, 46, 130
OFFSET
1,2
COMMENTS
Every nonnegative integer occurs infinitely many times. The j-sequence is A124904.
EXAMPLE
1=[3^0/2^0], 2=[3^2/2^2], 3=[3^1/2^0], 4=[3^2/2^1],...,
so j-sequence = (0,2,1,2,...); k-sequence = (0,2,0,1,...).
CROSSREFS
Cf. A124904.
Sequence in context: A030188 A176703 A160648 * A138752 A357499 A368506
KEYWORD
nonn
AUTHOR
Clark Kimberling, Nov 12 2006
STATUS
approved