98074

Appears in sequences

• a(n) is the least k, not multiple of 10, such that k^k contains a palindromic substring of length n.at n=21A115943
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + n*b(n-2), where a(0) = 1, a(1) = 2, b(0) = 4, and (a(n)) and (b(n)) are increasing complementary sequences.at n=18A296285