345678

Appears in sequences

• Numbers in which each digit is the (immediate) successor of the previous one (if it exists) and 0 is considered the successor of 9.at n=48A059043
• 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 triangle by rows.at n=17A078194
• Numbers with digits in ascending order that differ exactly by 1.at n=37A138141
• a(n) is the smallest number not yet in the sequence such that concatenation of all terms yields an infinite periodic stream of digits 1, 2, 3, ..., 8 (repeat from 1).at n=43A165306
• Triangle T(n,k) read by rows: Substring of k digits of sequence A007376, ending at position n, 1 <= k <= n.at n=33A224841
• Concatenation of the numbers from 3 to n.at n=5A284891
• Square array A(m,n) = concatenation of { m, m+1, ..., m+n }, with m, n >= 1, read by falling antidiagonals.at n=23A285807
• Lexicographically first sequence of distinct terms such that any set of seven successive digits can be reordered as {d, d+1, d+2, d+3, d+4, d+5, d+6}, d being the smallest of the seven digits.at n=38A302502
• Numbers whose digits are nonzero, consecutive, and all increasing or all decreasing.at n=63A352927