210000000
domain: N
Appears in sequences
- Triangle whose (i,j)-th entry is binomial(i,j)*10^(i-j)*10^j.at n=30A038312
- Number of shapes of balanced 10-ary trees with n nodes, where a tree is balanced if the total number of nodes in subtrees corresponding to the branches of any node differ by at most one.at n=17A229395
- Concatenate the positions of digits 0, 1,..., 9 in the decimal representation of n, using 1 for the rightmost digit etc., and 0 when the digit does not occur.at n=12A260519
- Concatenate the positions of digits 0, 1, ..., 9 in the decimal representation of n, using 1 for the leftmost digit etc., and 0 when the digit does not occur.at n=21A260520
- Lexicographically least strictly increasing sequence such that, for any n>0, Sum_{k=1..n} a(k) can be computed without carries in base 9 (the numbers are written in base 9).at n=34A281366