109876

Appears in sequences

• Smallest multiple of n with property that each digit is one less (mod 10) than the previous digit; or 0 if no such multiple exists.at n=26A062399
• Binary string self-substitutions: a(n) is obtained by substituting the binary expansion of n for each 1-bit in the binary expansion of n.at n=26A065159
• Smallest multiple of n starting with 1 with descending digit string (a left substring of 10987654321098...), 0 if no such number exists.at n=3A069886
• Smallest multiple of n starting with 1 with descending digit string (a left substring of 10987654321098...), 0 if no such number exists.at n=12A069886
• Start with 0; then add one to each single digit.at n=46A158699