100091

Appears in sequences

• a(n) = Sum_{k=0..n} (-1)^A010060(n-k)*[(n+1) mod (k+1) = 0]*10^k, where [] denotes the Iverson bracket.at n=5A101564
• 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=20A108224
• Numbers such that the digital sums in bases 2, 3, 5 and 10 all are equal.at n=17A135128
• Integers whose decimal representation consists of three distinct digits, one appearing once, one appearing twice, and one appearing three times.at n=22A182040