3456789
domain: N
Appears in sequences
- a(n) = (10^n-1)*(91/81)-n*10^n/9.at n=6A064616
- Smallest multiple of n formed by the concatenation of n successive numbers, or 0 if no such number exists.at n=6A077306
- 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=6A078193
- 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=27A078194
- a(n) = A082240(n)/n.at n=9A082241
- Multiples of 7 that are concatenation of 7 consecutive natural numbers.at n=0A082247
- a(n) = Sum_{ k = 0 to n-1} ( subtract k modulo 9 from 9, multiply this by k-th power of 10 ).at n=6A133486
- Numbers with digits in ascending order that differ exactly by 1.at n=41A138141
- Nonzero digits not used in n.at n=12A180408
- Nonzero digits not used in n.at n=21A180408
- Triangle T(n,k) read by rows: Substring of k digits of sequence A007376, ending at position n, 1 <= k <= n.at n=42A224841
- Smallest number with n = sum of distinct digits in decimal representation, cf. A217928.at n=42A227378
- a(n) is the concatenation of the numbers k, 2 <= k <= 9, such that the base-k representation of n, read as a decimal number, is prime; a(n) = 0 if there is no such base.at n=1A236356
- a(n) is the concatenation of the numbers k, 2 <= k <= 9, such that the base-k representation of n is a palindrome; a(n) = 0 if there is no such base.at n=1A236366
- Concatenation of the numbers from 3 to n.at n=6A284891
- Square array A(m,n) = concatenation of { m, m+1, ..., m+n }, with m, n >= 1, read by falling antidiagonals.at n=30A285807
- Spiral on a 2D square lattice, one term per cell, starting at the origin with 0; the four integers forming any 2 X 2 square have all digits 0 through 9 (with duplicate digits allowed).at n=3A337368