If we define “the simplest solution” as “the solution with the shortest program computing it”, then this problem is literally uncomputable, because it is equivalent to the halting problem. Moreover, it is proven that there is no algorithm that can in general case achieve results meaningfully better than “print the number from the lookup table”.
If we define “the simplest solution” as “the solution with the shortest program computing it”, then this problem is literally uncomputable, because it is equivalent to the halting problem. Moreover, it is proven that there is no algorithm that can in general case achieve results meaningfully better than “print the number from the lookup table”.