For fun I was whipping up some haskell one-liners as I read along.

You can just do:

    let fibs = 1 : 1 : [ fibs !! n + fibs !! (n - 1) | n <- [1..] ]

for the Fibonacci sequence and

    take 10 $ iterate (succ . recip) 1

for the first 10 iterations of the continued fraction.

To me these read much more clearly but then I haven't written anything big in a lispy language yet.