I've been revisiting some of the Project Euler problems that I skipped because I wasn't motivated at the time =)

Anyway, problem #4 is called "Largest palindrome product":

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 * 99.

Find the largest palindrome made from the product of two 3-digit numbers.^{Source: Problem 4 - Project Euler}

I have a solution and have calculated the largest products for the products of 2-, 3-, 4-, 5-, 6-, and 7-digit numbers. And I get the sequence below (starting from the largest for 4-digit numbers so I don't give the answer to the question from Project Euler.

9999 * 9901 = 99000099

99979 * 99681 = 9966006699

999999 * 999001 = 999000000999

9999979 * 9467731 = 94677111177649

This sequence (of the results) doesn't seem to be a named sequence. Is it too boring? Surely there must be a sequence or related sequence... I'm sure there are more obscure sequences than this one that are listed on, for example, on oeis.org.

My solution is still brute force and that makes me uneasy but I can't seem to get my lightbulb to light.