Euler Problem 002 (2)

euler02.fsx

let eulerProblem2Answer = 
    (0,1) 
    |> Seq.unfold (fun (f1,f2) -> Some(f2, (f2, f1+f2)))  // Fibonacci Sequence
    |> Seq.takeWhile(fun x -> x < 4000000) // Taking upto Max Fibbonacci  
    |> Seq.filter (fun x -> x%2=0) // Filtering only even numbers 
    |> Seq.sum // computing sum