Derive an algorithm to find a number that is a b-palindrome, of at least four digits, for at least 10,000 different values of b.

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