title: Memoization in Haskell?
body: <p>Any pointers on how to solve efficiently the following function in Haskell, for large numbers <code>(n &gt; 108)</code></p>
  
  <pre><code>f(n) = max(n, f(n/2) + f(n/3) + f(n/4))
  </code></pre>
  
  <p>I've seen examples of memoization in Haskell to solve fibonacci
  numbers, which involved computing (lazily) all the fibonacci numbers
  up to the required n. But in this case, for a given n, we only need to
  compute very few intermediate results.</p>
  
  <p>Thanks</p>