456789

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=49A059043
• a(n) = (10^n-1)*(91/81)-n*10^n/9.at n=5A064616
• a(n) = Sum_{ k = 0 to n-1} ( subtract k modulo 9 from 9, multiply this by k-th power of 10 ).at n=5A133486
• Numbers with digits in ascending order that differ exactly by 1.at n=38A138141
• Minimum number n, not already present, that permits the cyclic repetition of the decimal digits 1,2,3,4,5,6,7,8,9 in the sequence.at n=47A165307
• Triangle T(n,k) read by rows: Substring of k digits of sequence A007376, ending at position n, 1 <= k <= n.at n=41A224841
• Smallest number with n = sum of distinct digits in decimal representation, cf. A217928.at n=39A227378
• Square array A(m,n) = concatenation of { m, m+1, ..., m+n }, with m, n >= 1, read by falling antidiagonals.at n=31A285807
• Numbers m with decimal expansion (d_k, ..., d_1) such that d_i = m * i mod 10 for i = 1..k.at n=43A344748