

A124913


a(n) = least integer k>=0 such that n=Floor[(3^j)/(4^k)] for some integer j>=0.


1



0, 1, 0, 6, 2, 1, 12, 4, 0, 7, 3, 14, 10, 6, 2, 17, 13, 9, 5, 1, 16, 35, 12, 8, 4, 23, 0, 38, 15, 11, 30, 7, 26, 3, 22, 18, 60, 14, 56, 33, 10, 29, 6, 25, 2, 21, 105, 40, 17, 36, 13, 55, 32, 9, 135, 28, 5, 131, 24, 1, 85, 20, 230, 39, 16, 100, 35, 203, 12, 222, 31, 8, 50, 27, 69, 4, 46
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,4


COMMENTS

Each nonnegative integer occurs infinitely many times. The jsequence is A124905.


LINKS



EXAMPLE

1=[3^0/4^0], 2=[3^2/4^1], 3=[3^1/4^0], 4=[3^9/4^6],...,
so jsequence=(0,2,1,9,...); ksequence=(0,1,0,6,...).


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



