Problem Statement

Calculate the sequence where each term an is the smallest natural number greater than the previous term, that has exactly n divisors.

Show here, on this page, at least the first 15 terms of the sequence.

Let's start with the solution:

i: new 0
next: new 1
MAX: 15
while [next =< MAX][
    if next = size factors i [
        prints ~"|i| "
        inc 'next
    ]
    inc 'i
]
print ""