title: Fibonacci sequence in haskell returning all the values
body: <p>I need help for my assignment using haskell which return a list up to the nth number in the Fibonacci sequence.</p>
  
  <p>like</p>
  
  <pre><code>Main&gt; fib 5
  [0,1,1,2,3,5]
  Main&gt; fib 15
  [0,1,1,2,3,5,8,13,21,34,55,89,144,233,377,610]
  </code></pre>
  
  <p>I understand this</p>
  
  <pre><code>fib::Int-&gt;Int
  fib 0 = 0
  fib 1 = 1
  fib n = fib (n-1) + fib (n-2)
  </code></pre>
  
  <p>but I don't know how to produce list that containing all the value up to the nth number.</p>
  
  <p>Thank you</p>