[Haskell-cafe] "translating" recursively defined sequence

[Christopher Howard]

Hi. My Haskell is (sadly) getting a bit rusty. I was wondering what
would be the most straightforward and easily followed "procedure" for
translating a recursively defined sequence into a Haskell function. For
example, this one from a homework assignment.

quote:
--------
a_1 = 10
a_(k+1) = (1/5) * (a_k)**2
--------

(The underscore is meant to represent subscripting what follows it.)

-- 
frigidcode.com

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 555 bytes
Desc: OpenPGP digital signature
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20130304/5bf42a2b/attachment.pgp>