> What you get is a java.lang.OutOfMemoryError: Java heap space and not a
> stack overflow: you get out of memory because:
> - the sequence is memoized
> - the sequence is rooted (for the GC) and thus can't be reclaimed.

> > I know that the JVM does not offer tail-call optimization, but is
> > there a way to rewrite the example (perhaps with (recur ...)) so that
> > (nth fib-seq N) runs in constant space?

> Turning the seq into a fn will allow it to be reclaimed and thus the
> computation will run in constant space.

> (defn fib-seq[]

>   (concat
>    [0 1]
>    ((fn rfib [a b]
>         (lazy-cons (+ a b) (rfib b (+ a b)))) 0 1)))

> (let [r (nth (fib-seq) 100000)] r)