|
%I #12 Mar 15 2024 07:26:30
%S 0,2,7,3,1,8,4,2,13,11,7,5,3,16,14,27,12,10,8,21,6,19,4,17,2,15,28,13,
%T 26,11,39,24,9,22,7,35,20,5,33,18,3,31,16,44,29,57,14,42,27,55,12,40,
%U 25,53,10,38,23,94,8,36,107,21,49,6,34,105,19,47,4,32,103,17,88,45,116,30
%N a(n) = least integer j >= 0 such that n = floor((5^j)/(3^k)) for some integer k >= 0.
%C The k-sequence is A124918.
%H Robert Israel, <a href="/A124910/b124910.txt">Table of n, a(n) for n = 1..10000</a>
%e 1 = floor(5^0 / 3^0),
%e 2 = floor(5^2 / 3^2),
%e 3 = floor(5^7 / 3^9),
%e 4 = floor(5^3 / 3^3), ...,
%e so j-sequence = (0,2,7,3,...); k-sequence = (0,2,9,3,...).
%p N:= 100: # for a(1) .. a(N)
%p V:=Vector(N,-1): count:= 0:
%p for j from 0 while count < N do
%p x:= 5^j;
%p k0:= max(0,floor(log[3](x/N)));
%p x:= x/3^(k0-1);
%p for k from k0 do
%p x:= x/3;
%p if x < 1 then break fi;
%p m:= floor(x);
%p if m <= N and V[m] = -1 then V[m]:= j; count:= count+1 fi
%p od od:
%p convert(V,list); # _Robert Israel_, Mar 08 2024
%Y Cf. A124918.
%K nonn
%O 1,2
%A _Clark Kimberling_, Nov 13 2006, corrected Nov 13 2006
|
