Optimising a function that uses sum and map

Question

I have this function:

fn n | n < 5 = 1
fn n = sum (map fn [n-5..n-1])

But when I use a big value such as 900, it takes ages. How can I mak