All positive integers may be represented as a unique sum of Fibonacci numbers such that it begins with the first Fibonacci number and does not contain any consecutive Fibonacci numbers. Where n is an integer it can be written as Fa1+Fa1+Fa2+Fa1+Fa3+...+Fak where ak+1-k≥2.