%I A124916
%S A124916 0,0,1,0,2,1,13,0,15,2,14,1,4,13,22,0,9,15,24,2,8,14,17,23,1,4,10,13,19,
%T A124916 22,28,0,6,9,12,15,21,24,27,2,5,8,11,42,14,17,20,23,26,29,1,4,7,10,41,
%U A124916 13,16,47,19,22,25,56,28,0,3,34,6,9,40,12,43,15,18,49,21,52,24,55,27,58
%N A124916 a(n) = least integer k>=0 such that n=Floor[(2^j)/(5^k)] for some integer 
               j>=0.
%C A124916 Every nonnegative integer occurs infinitely many times. The j-sequence 
               is A124908.
%e A124916 1=[2^0/5^0], 2=[2^1/5^0], 3=[2^4/5^1], 4=[2^2/5^0],...,
%e A124916 so j-sequence=(0,1,4,2,...); k-sequence=(0,0,1,0,...).
%Y A124916 Cf. A124908.
%Y A124916 Sequence in context: A012585 A053566 A009483 this_sequence A007418 A037271 
               A074955
%Y A124916 Adjacent sequences: A124913 A124914 A124915 this_sequence A124917 A124918 
               A124919
%K A124916 nonn
%O A124916 1,5
%A A124916 Clark Kimberling (ck6(AT)evansville.edu), Nov 12 2006