100090

Appears in sequences

• Numbers having four 0's in base 10.at n=26A043492
• Smallest number that requires n steps to reach 0 when iterating the mapping k -> abs(reverse(lpd(k))-reverse(Lpf(k))). lpd(k) is the largest proper divisor and Lpf(k) is the largest prime factor of k.at n=20A076424
• Suppose you take the ten digits 0..9, arrange them in any order and then either concatenate adjacent ones or separate them with a plus or minus sign, e.g., 98-76+5-4-32+10 or 9-8-765+3041-2. The first expression totals to "1", the second example totals to "2275". This sequence lists the positive integers that cannot be expressed in this way.at n=19A108224
• Least multiple of n in which the n-th digit from left is 9.at n=4A113564
• Numbers such that the digital sums in bases 2, 3, 5 and 10 all are equal.at n=16A135128
• Numbers k such that k and k^2 use only the digits 0, 1, 4, 8 and 9.at n=53A136867
• Numbers k such that k and k^2 use only the digits 0, 1, 5, 8 and 9.at n=37A136874
• Numbers k such that k and k^2 use only the digits 0, 1, 6, 8 and 9.at n=39A136879
• Numbers k such that k and k^2 use only the digits 0, 1, 7, 8 and 9.at n=39A136880
• Numbers k such that k and k^2 use only the digits 0, 1, 8 and 9.at n=37A136881
• Totally multiplicative sequence with a(p) = a(p-1) + 9 for prime p.at n=33A166706
• Number of n X 3 arrays of the minimum value of corresponding elements and their horizontal, vertical or antidiagonal neighbors in a random, but sorted with lexicographically nondecreasing rows and columns, 0..1 n X 3 array.at n=38A219699