1234567890

Appears in sequences

• Multiples of 123456789.at n=9A053654
• Concatenate next digit at right hand end (where the next digit after 9 is again 0).at n=10A057137
• Smallest number that begins with 1, has digits in order 123...901... and is divisible by n. If no such number exists then a(n) = 0.at n=9A061074
• Smallest multiple of n containing all 10 digits from 0 to 9.at n=9A061604
• a(n) = Sum_{i=1..n} n^i * (n - i).at n=9A062808
• In the following triangle the n-th row contains n n-digit (or (n-1)-digit) numbers whose concatenation (with a 0 prefixed for (n-1)-digit numbers) gives a substring of the cyclic concatenation of 1,2,3,4,5,6,7,8,9,0,1,2,3,4,5,6,7,8,9,0,1,2,...: 1; 12 34; 123 456 789; 1234 5678 9012 3456; 12345 67890 12345 67890 12345; ... Sequence contains the final terms of rows.at n=9A078193
• Anagram multiples of 123456789.at n=0A167461
• Pandigital numbers n with at least 4 nontrivial anagrams divisible by n.at n=8A167476
• Largest integer m such that both m and n*m are decimal pandigital numbers (A050278).at n=7A204058
• a(n) = concatenation of periods of periodic sequences of ending digits of multiples of n.at n=0A211770
• a(n) = concatenation of periods of periodic sequences of ending digits of multiples of n.at n=10A211770
• a(n) = concatenation of periods of periodic sequences of ending digits of multiples of n.at n=20A211770
• a(n) is the repeating digit pattern in penultimate digit of successive powers of n (omitting initial powers without at least two digits).at n=9A253389
• a(n) is the smallest pandigital number divisible by n, or 0 if no such pandigital number exists.at n=9A302096
• a(n) is the greatest k >= 0 such that n*k has distinct decimal digits.at n=7A328291
• a(n) is the least multiple of n that contains all digits 0-9 at least once.at n=0A391190
• a(n) is the least multiple of n that contains all digits 0-9 at least once.at n=1A391190
• a(n) is the least multiple of n that contains all digits 0-9 at least once.at n=2A391190
• a(n) is the least multiple of n that contains all digits 0-9 at least once.at n=4A391190
• a(n) is the least multiple of n that contains all digits 0-9 at least once.at n=5A391190