Does my rearrangement of the sequence to prove that - any $n\in\mathbb N$ can be written as the sum of Fibonacci numbers - look fine?
Proof by induction that if $n \in \mathbb N$ then it can be written as sum of different Fibonacci numbers