title: Summing the first n odd numbers in Haskell
body: <p>I'm new to Haskell -and functional programming altogether- and I wanted to know how would you write such a function in Haskell. I'm used to imperative languages but handling recursion in haskell is elusive to me right now. Note that I know that the sum of odd numbers could be done with n^2 (i.e. sum of the 3 first odd numbers 1 + 3 + 5 = 9 = 3^2) but the idea is to learn recursion with functional programming. </p>
  
  <p>Also, I'm doing this is as part of an algebra workshop and we haven't seen much yet. I need a way to solve it only with recursion.</p>
  
  <p>Any hints? Thanks!</p>