

A124919


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


2



0, 1, 3, 7, 0, 2, 4, 34, 6, 43, 15, 1, 38, 17, 3, 47, 33, 19, 5, 56, 42, 28, 14, 7, 0, 51, 37, 30, 16, 9, 2, 60, 46, 39, 32, 25, 18, 11, 4, 62, 55, 48, 41, 34, 27, 20, 13, 6, 71, 64, 57, 50, 115, 43, 36, 29, 94, 22, 15, 80, 8, 1, 66, 59, 124, 52, 45, 110, 38, 103, 31, 24, 89, 17, 82
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

Every nonnegative integer occurs infinitely many times. The jsequence is A124911.


LINKS



EXAMPLE

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


MAPLE

N:= 100: # for a(1) .. a(N)
V:=Vector(N, 1): count:= 0:
for j from 0 while count < N do
x:= 5^j;
k0:= max(0, floor(log[2](x/N)));
x:= x/2^(k01);
for k from k0 do
x:= x/2;
if x < 1 then break fi;
m:= floor(x);
if m <= N and V[m] = 1 then V[m]:= k; count:= count+1 fi
od od:


CROSSREFS



KEYWORD

nonn


AUTHOR



STATUS

approved



