Test task. Fibonacci number

This is sequence, such that each number is the sum of the two preceding ones.

fn(n) = fn(n-2) + fn(n-1)

Function returns list N numbers.

Ex.

fido(6) 
[1, 1, 2, 3, 5, 8]