I mean it depends on the todo.

if to-do 1 is Determine all positive integers n such that the concatenation of n and n^2 in base b uses at most k distinct characters, for fixed b and k - you might be there a while