10000000010
domain: N
Appears in sequences
- Smallest n-digit number divisible by n.at n=10A053041
- a(n) = n^n + n.at n=10A066068
- Smallest multiple of n with digit sum = 2, or 0 if no such number exists, e.g., a(3k)=0.at n=37A069521
- Smallest multiple of n with least digit sum.at n=37A077194
- a(1) = 1, a(n) = the smallest squarefree number > a(n-1) which contains all the digits of a(n-1).at n=19A077712
- Smallest multiple of n in which the string of digits of n occurs after (n-1) most significant digits.at n=9A079847
- Leading terms of rows in A081551.at n=10A081552
- Least multiple of n in which the n-th digit from left is 1.at n=9A113556
- Least n-digit multiple of n whose digit permutations yield at least n distinct multiples of n, or 0 if no such number exists.at n=10A113599
- a(n) = n^10 + n.at n=10A196292
- a(n) = Sum_{k=1..n} phi(gcd(k, n))^(n-1).at n=10A342540
- a(n) = Sum_{k=1..n} phi(gcd(k, n))^(gcd(k, n) - 1).at n=10A342544