[Haskell-cafe] About Fibonacci again...

[Henning Thielemann]

On Thu, 8 Nov 2007 jerzy.karczmarczuk at info.unicaen.fr wrote:

> Report from the Rabbit Warren.
>
> Thank you, everybody, for your contribution. The problem was, how to
> construct a one-liner which generates the infinite Rabbit Sequence:
> 10110101101101011010110110101101101011010110110101101011011010110...
> This is the result of an *infinite time* evolution of a system which
> iteratively rewrites one young rabbit: 0 -> 1, an old one, and one old:
> 1 -> 10: itself and a young offspring. The finite sequence after n units
> of time fulfils: rs n = rs (n-1) ++ rs (n-2).

And now we have much Haskell code for one sequence to be submitted to the
Online Encyclopedia of Integer Sequences!