67890

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=42A059043
• 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=11A078194
• 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=13A078194
• Let S = 12345678901234567890123456..., the cyclic concatenation of digits; partition this string into distinct squarefree numbers. To avoid leading zeros, no member may end with the digit 9.at n=24A085944
• Smallest available integer which fits into the repeating pattern 0123456789.at n=36A098755
• Composites with consecutive (ascending) digits.at n=32A161760
• Number of nX6 0..1 arrays with rows, columns and antidiagonals unimodal and diagonals nondecreasing.at n=8A223768
• a(n) = n*(n + 1)*(5*n - 4)/2.at n=30A237616
• Least positive integer k such that prime(k)-k, prime(k)+k, prime(k*n)-k*n, prime(k*n)+k*n, prime(k)+k*n and prime(k*n)+k are all prime.at n=36A259492