I made a prodecure:

with(numtheory);
divs:=proc(k)
local n,q:
for n from 1 to infinity do
q:=tau(n);
if k=q then break;
end if;
end do;
return [q,n];
end proc;
[seq(divs(i),i=1..20)];

I have make it for i from 1 to 100 too, but it should work in five minutes. I think it should be made somehow with the integer factorization, but i can't realize it. Can someone help me?

Eryndis