fib :: Int -> Int
fib 0 = 1
fib 1 = 1
fib n = fib (n-1) + fib (n-2)

contar :: Int -> Int -> Int -> [Int] -> [Int]
contar n cont aux lista
 |n==0 = []
 |cont == n = lista
 |mod (fib aux) 2 == 0 = contar n (cont+1) (aux+1) (lista ++ [fib aux])
 |otherwise = contar n cont (aux+1) lista

 fibonacci :: Int -> [Int]
 fibonacci n = contar n 0 0 []