While pondering about a pointless optimization of a pointless feature of one of my pointless projects, I stumbled upon a #toyprogrammingchallenge similar to this one
https://qoto.org/@Absinthe/103194125533950090
but different.

A couple of ways to put it.

Colloquial(mathy jargon):
Given a prime factorization of a number, generate all of its factors(prime or otherwise) in ascending order.

Down to code(with fumbling):
Given a multiset(in ascending order) of prime numbers, generate all numbers... whose prime factors are subsets of that set... too mathy?... maybe then "that can be obtained by multiplying numbers from that set together"... in ascending order.

Examples:

Input: 30 = (2,3,5)
Output: ([1,]2,3,5,6,10,15[,30])

Input: 60 = (2,2,3,5)
Output: ([1,]2,3,4,5,6,10,12,15,20,30[,60])