999999990

Appears in sequences

• a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 99.at n=8A093299
• a(n) = 10*(10^n-1).at n=8A124167
• a(n) = n^9 - n.at n=10A196289
• a(n) is the number of labeled rooted trees on a set of size n where each node has at most 8 neighbors that are further away from the root than the node itself.at n=10A325207