fsharp-prime

prime.fs

    let prime () =
        let infinity = Seq.initInfinite (fun i -> i + 1) |> Seq.filter (fun n -> n >= 2) |> Seq.cache

        let rec inner (nums: seq<int>) = seq {
            let i = Seq.item 0 nums
            yield i
            let next = nums |> Seq.filter (fun n -> n % i <> 0) |> inner
            yield! next
            }

        inner infinity