title: How to generate all multiplicative partitions of a number if I have a list of primes/exponents?
body: <p>For instance, the number 24 has prime factorization 2^3*3^1, and can be written in the following ways</p>
  
  <pre><code>1*24
  2*12
  2*2*6
  2*3*4
  2*2*2*3
  3*8
  4*6
  </code></pre>
  
  <p>I may have missed one but you get the idea.</p>
  
  <p>I tried looking into the other thread <a href="https://stackoverflow.com/questions/8558292/how-to-find-multiplicative-partitions-of-any-integer">How to find multiplicative partitions of any integer?</a> but couldn't understand the answers in all honesty.</p>
  
  <p>I don't need anyone to write code for me but rather I could really use some help creating an efficient algorithm for this (probably something recursive?). </p>
  
  <p>I am coding in Python.</p>