I decided to make a simple recursive solution to this after my overly-theoretical and non-useful solution to the last one. It works by generating a range, converting each number to a string, joining all the strings, and getting the length of that string. Then, it keeps expanding the lower and upper bounds of the search until it finds a palindrome.