Show how to find a number that is a b-palindrome, of at least three digits, for at least 1000 different values of b.

For example, 200 is not a 10-palindrome, but it is a 9-palindrome (242) and a 7-palindrome (404).

No, it must have at least three digits in each base to count .. <i>any</i> number is a single digit when the value of the base is larger than the number itself, for an infinite number of bases.

This problem could move to the algorithms category, and instead of specifically naming 1000 in the problem, I could have said, "Given any positive integer k, how how to find a number that is a b-palindrome, of at least three digits, for at least k different values of b." I picked 1000 just as a large number to eliminate someone finding "by accident" a solution for a specific smaller number, had I chosen one.

My reference to "three digits in decimal" was referring not to the solution of the cited problem, but the simpler case of finding a value that works for only 7 digits. The point was that, while the previously offered methods do indeed work, the one I have produces substantially smaller numbers.