1999999

Appears in sequences

• a(n) is the smallest number k such that the letter "N" appears n times when k is written in English.at n=16A060227
• Smallest number with digit sum = Fibonacci(n).at n=10A061249
• a(n) = 2*10^(n-1) - 1.at n=6A067272
• Number of palindromes of length <= n.at n=11A070199
• a(n) is the smallest composite number with the sum of digits = the n-th composite number.at n=37A073866
• Numbers k such that the k-th triangular number contains only digits {0,1,9}.at n=24A119048
• Numbers k such that the decimal representation of k is contained as substring in that of the k-th triangular number.at n=32A119238
• Smallest number whose sum of digits is 2n+1.at n=27A131668
• Smallest number whose sum of digits is 3n+1.at n=18A133264
• The smallest composite number larger than the n-th composite number, which has a sum of digits equal to the n-th composite number.at n=37A161551
• Lexicographically earliest injective sequence such that a(n) = A007953(a(a(n))), where A007953 = sum of digits (in base 10).at n=54A167152
• a(n+1) is the smallest integer such that the difference between its digital sum and the digital sum of a(n) is n.at n=10A269306
• A number N is called a "rebel" number if there do not exist two integers a and b such that N = a + b with a > b > 0 and S(a) = S(b) where S(n) is the sum of the digits of the number n.at n=45A292514