45678

Appears in sequences

• Number of self-avoiding walks of length n on the Laves graph.at n=15A046944
• 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=40A059043
• Smallest number that has digits in order ...123...901... and is divisible by n. If no such number exists then a(n) = 0.at n=45A061805
• 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=6A085944
• a(n+1) is the least positive integer k such that (1) k is a one-digit number or the concatenation of two or more consecutive numbers; (2) |k-a(n)| is prime; (3) k is not already in the sequence; and (4) |k-a(n)| is not the absolute difference of two previous consecutive members of the sequence.at n=32A090910
• Smallest available integer which fits into the repeating pattern 0123456789.at n=43A098755
• Numbers with digits in ascending order that differ exactly by 1.at n=33A138141
• Composites with consecutive (ascending) digits.at n=30A161760
• 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=39A165306
• 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=42A165307
• Put the natural numbers together without spaces and read them five at a time advancing one space each time.at n=3A193493
• Triangle T(n,k) read by rows: Substring of k digits of sequence A007376, ending at position n, 1 <= k <= n.at n=32A224841
• Square array A(m,n) = concatenation of { m, m+1, ..., m+n }, with m, n >= 1, read by falling antidiagonals.at n=24A285807
• Number of ordered ways of writing n^2 as a sum of n squares of nonnegative integers.at n=8A298329
• Lexicographically first sequence of distinct terms such that any set of six successive digits can be reordered as {d, d+1, d+2, d+3, d+4, d+5}, d being the smallest of the six digits.at n=57A302501
• 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=50A302502
• Lexicographically first sequence of distinct terms such that any set of eight successive digits can be reordered as {d, d+1, d+2, d+3, d+4, d+5, d+6, d+7}, d being the smallest of the eight digits.at n=51A302503
• Numbers whose digits are nonzero, consecutive, and all increasing or all decreasing.at n=54A352927
• Expansion of 1/Product_{k>=1} (1 - x^k)^(valuation(k,4) + 1).at n=36A373295
• Decimal concatenation of the 5 numbers n,n+1,n+2,n+3,n+4.at n=3A375692