"Every positive number bigger than 1 can be represented as a sum of a square, a nonnegative cube and two positive Fibonacci numbers".
Find the smallest integer n justifying the title of this puzzle.
Rem: It is quite a big number!
The answer (1,149,053,396) is not important!
What matters is the fact that over 10^9 numbers comply with a certain conjecture and suddenly a wise-guy-number pops up
that does not.
Read more @ OEIS A115713.