

A124904


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


2



0, 2, 1, 2, 4, 3, 5, 7, 2, 4, 6, 8, 3, 10, 5, 12, 7, 14, 9, 4, 11, 6, 18, 13, 8, 32, 3, 10, 22, 5, 29, 12, 36, 7, 31, 14, 38, 9, 33, 4, 16, 40, 11, 35, 6, 18, 42, 13, 25, 49, 8, 32, 44, 15, 27, 39, 10, 22, 34, 5, 17, 29, 41, 12, 24, 36, 48, 7, 19, 31, 43, 14, 26, 38, 91, 9, 21, 33, 86
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS



LINKS



EXAMPLE

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


PROG

(PARI) See Links section.


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



