Mathematics Proof Help?

Show that the number of ways of writing a positive integer n in the form n=m1+m2+...+mk where k is an arbitrary integer and m1,m2,...,mk are arbitrary odd positive integers in Fn where Fn is the nth Fibonacci number