399999

Appears in sequences

• Smallest number whose sum of digits is n.at n=48A051885
• Smallest composite number with digit sum n.at n=47A067524
• a(n) is the smallest composite number with the sum of digits = the n-th composite number.at n=31A073866
• Triangle read by rows: T(n, k) = 10^(n-1) - 1 + k*floor(9*10^(n-1)/n), for 1 <= k <= n.at n=16A093846
• Smallest number whose sum of digits is 3n.at n=16A133195
• Smallest number whose sum of digits is 2n.at n=24A133296
• a(1)=0, a(n+1) is the smallest nonprime with sum of digits > sum of digits of a(n).at n=44A156673
• 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=31A161551
• The smallest number larger than n with digital sum equal to n.at n=47A161561
• Lexicographically earliest injective sequence such that a(n) = A007953(a(a(n))), where A007953 = sum of digits (in base 10).at n=47A167152
• a(n) = 4*10^n - 1.at n=5A198970
• Smallest odd number with digit sum equal to n.at n=47A205960
• Numbers m having with m+1 no common digit in decimal representations.at n=44A226637
• Smallest number such that the sum of the digits of n * a(n) is greater than n.at n=49A269333
• Partial sums of A278742.at n=22A280730
• Expansion of x*(1 + 2*x*(5 - 4*x)*(1 + x^2)*(1 + x^4))/((1 - x)*(1 - 10*x^9)).at n=48A302556
• a(n) is the smallest m such that for any N, at least one of S(N), S(N+1), ..., S(N+m-1) is divisible by n, where S(N) is the sum of digits of N.at n=46A331788
• a(n) is the smallest m such that for any N, at least one of S(N), S(N+1), ..., S(N+m-1) is divisible by n, where S(N) is the sum of digits of N.at n=47A331788
• a(n) is the smallest positive number m not yet in the sequence with the property that the sum of the even digits of m and the sum of the odd digits of m differ by n.at n=48A341011