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:

  [ dup factors size mod 0 = ] is taunumber ( n --> b )

  [] 0
  [ 1+ dup taunumber if
      [ tuck join swap ]
    over size 100 = until ]
  drop
  [] swap 
  witheach [ number$ nested join ]
  80 wrap$