let rec sieve integers =
    let p = Seq.head integers
    let xs = Seq.skip 1 integers
    seq {
        yield p
        yield! sieve (seq {
            for x in xs do
                if (x % p <> 0) then yield x })
    }

[<EntryPoint>]
let main argv =
    let primes = sieve (Seq.initInfinite(fun i -> i + 2))
    printfn "%A" primes
    0