OFFSET
1,2
COMMENTS
Every nonnegative integer occurs infinitely many times. The j-sequence is A124910.
LINKS
Robert Israel, Table of n, a(n) for n = 1..10000
EXAMPLE
1 = floor(5^0 / 3^0),
2 = floor(5^2 / 3^2),
3 = floor(5^7 / 3^9),
4 = floor(5^3 / 3^3), ...,
so j-sequence = (0,2,7,3,...); k-sequence = (0,2,9,3,...).
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[3](x/N)));
x:= x/3^(k0-1);
for k from k0 do
x:= x/3;
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:
convert(V, list); # Robert Israel, Mar 08 2024
CROSSREFS
KEYWORD
nonn
AUTHOR
Clark Kimberling, Nov 13 2006
STATUS
approved