>Is there a way to generate pairs of numbers in ascending order of their product?

ascending_products.py

from functools import reduce
from more_itertools import set_partitions
import operator
from sympy.ntheory import factorint
from time import sleep


def prod(nums):
    return reduce(operator.mul, nums, 1)


def map_prod(partition):
    return sorted(map(prod, partition))


def naturals():
    n = 0
    while True:
        yield n
        n += 1


for n in naturals():
    factors = []
    for k, v in factorint(n).items():
        factors += v * [k]

    res = []
    for pair in map(map_prod, set_partitions(factors, 2)):
        if pair not in res:  # Avoid duplicates
            res.append(pair)

    print(n, res if res else "/")
    sleep(.1)