title: Interesting puzzle in Haskell
body: <p>Hello studying Haskell I came up at an exercise at the web that it requested to create a list given an integer the way described below:</p>
  
  <p>for example if integer was 3 then a list should be generated that it contains the following:</p>
  
  <pre><code>[[3],[1,2],[2,1],[1,1,1]]
  </code></pre>
  
  <p>note </p>
  
  <pre><code>3=3
  1+2=3
  2+1=3
  1+1+1=3
  </code></pre>
  
  <p>if integer was 2 then it would be:</p>
  
  <pre><code>[[2],[1,1]]
  </code></pre>
  
  <p>I cannot think a way of implementing this, so can you provide me with any hints? I believe that I must use list comprehension but I cannot think anything further than this </p>