9000000000

Appears in sequences

• a(n) = 10^n - n^9.at n=10A024123
• Number of nonzero palindromes of length n.at n=18A050683
• Number of nonzero palindromes of length n.at n=19A050683
• First differences of 10^n (A011557).at n=9A052268
• Number of nonnegative integers with n digits.at n=9A063945
• Number of endofunctions of [n] such that 1 is not a fixed point.at n=9A066274
• Number of n-digit palindromes.at n=18A070252
• Number of n-digit palindromes.at n=19A070252
• Least multiple of n such that the n-th partial sum is an n-th power with the condition that a(n+1) exists.at n=9A090962
• a(n) is the least nonnegative integer in base 10 containing n zeros that is divisible by n.at n=8A112889
• Numbers k such that the k-th triangular number contains only digits {0,4,5}.at n=27A119072
• a(n) = n*10^n.at n=9A126431
• Assign weights to the nonnegative integers as in A073327, then sort them by weight.at n=36A152611
• Number of permutations of 9 indistinguishable copies of 1..n arranged in a circle with exactly 1 local maximum.at n=8A159740
• a(n) = the smallest number ending in n zeros divisible by n.at n=8A173481
• a(n) = the smallest (n+1)-digit number ending in n zeros that is divisible by n, else 0.at n=8A173482
• a(n) = the largest (n+1)-digit number ending in n zeros that is divisible by n, else 0.at n=8A173483
• a(n) = the largest (n+2)-digit number ending in n+1 zeros that is divisible by n, else 0.at n=7A173486
• Number A(n,k) of n-digit k-th powers; square array A(n,k), n>=1, k>=1, read by antidiagonals.at n=54A216653
• a(n) = n^10 - n^9.at n=10A240933