49998

Appears in sequences

• Smallest multiple of n whose digits sum to n.at n=39A002998
• Inverse Moebius transform of A000013 (starting at term 0).at n=21A054168
• Smallest proper multiple of n with digit sum n.at n=38A069035
• Smallest even number with digit sum n.at n=38A069532
• Smallest multiple of n with two or more digits, none of them zeros, whose digit sum equals n, or 0 if no such multiple exists.at n=38A077754
• Numbers k such that k divides the sum of digits of all numbers from 1 to k.at n=44A114136
• Numbers k such that k and k^2 use only the digits 0, 2, 4, 8 and 9.at n=44A136909
• a(n) is the smallest number which is divisible by n, is not equal to n and its digital sum is also divisible by n.at n=38A163502
• Let p = first digit of n, q = number obtained if p is removed from n; let r = last digit of n, s = number obtained if r is removed from n; sequence give n such that p*q = r*s != 0, p! = q, and r! = s.at n=37A245364
• Numbers N such that N = P//Q = R//S, where // is the concatenation function, satisfying the following properties: P and S are m-digit integers, Q and R are k-digit integers, k and m are distinct positive integers, and P*Q = R*S.at n=39A245385
• Numbers in A245385 where P, Q, R, and S are all distinct.at n=17A245386
• Number of n X 3 0..1 arrays with each 1 horizontally or vertically adjacent to 1 or 4 1s.at n=9A295115
• Integers without 0 as a digit, with an odd number of digits, that are not repdigits, and such that the 2 products [d_1 d_2...dk]*[d_k+1 d_k+2...d_2k+1] and [d_1 d_2...d_k+1]*[d_k+2 d_k+2...d_2k+1] are equal.at n=9A385145