99999999990
domain: N
Appears in sequences
- In the pile of coconuts problem, the number of coconuts that remain to be shared equally at the end of the process.at n=9A002022
- Largest n-digit multiple of n.at n=10A066557
- a(n) is the largest number such that all of a(n)'s length-n substrings are distinct and divisible by 99.at n=10A093299
- n times largest n-digit number.at n=10A110807
- a(n) is the least positive integer in base 10 containing n nines that is divisible by n.at n=9A112909
- Number of functions f: {1, 2, ..., n} --> {1, 2, ..., n} such that f(1) != f(2), f(2) != f(3), ..., f(n-1) != f(n), f(n) != f(1).at n=9A118537
- a(n) = 10*(10^n-1).at n=10A124167
- Number of 10-ary sequences with primitive period n.at n=11A218127
- Osiris or Digit re-assembly numbers: numbers that are equal to the sum of permutations of subsamples of their own digits.at n=25A319274
- a(n) = n^n*n - n.at n=10A345360