Problem Statement

A Tau number is a positive integer divisible by the count of its positive divisors.

Show the first   100   Tau numbers. The numbers shall be generated during run-time (i.e. the code may not contain string literals, sets/arrays of integers, or alike).

Let's start with the solution:

tau: function [x] -> size factors x

found: 0
i:1
while [found<100][
    if 0 = i % tau i [
        prints pad to :string i 5
        found: found + 1
        if 0 = found % 10 -> print ""
    ]
    i: i + 1
]