23451

Appears in sequences

• Concatenations of cyclic permutations of initial positive integers.at n=11A001292
• Positive numbers k such that k and 2*k are anagrams in base 6 (written in base 6).at n=29A023064
• Numbers with 5 distinct digits {1,2,3,4,5} such that all adjacent digits (as well as first and last digits) are coprime.at n=18A104972
• Integers are written in the form abcd...n where "a" means "At position a in this integer there is a digit b"; "b" means: "at position b there is a digit c"; "c" means: "at position c there is a digit d"; ... and "n" means: "at position n there is a digit a".at n=19A105956
• Integers are written in the form abcd...n where "a" means "At position a in this integer there is a digit b"; "b" means: "at position b there is a digit c"; "c" means: "at position c there is a digit d"; ... and "n" means nothing. No repetitions are allowed (like in the integer 111).at n=38A105958
• a(n) is the smallest number not already in the sequence, such that the concatenation of all a(n) displays the periodic digit string 1, 2, 3, 4, 5 (and repeat).at n=22A165303
• Number of (n+2) X (4+2) 0..3 arrays with every 3 X 3 subblock row and column sum not equal to 0 3 5 6 or 7 and every 3 X 3 diagonal and antidiagonal sum equal to 0 3 5 6 or 7.at n=21A252250
• Fixed points of the function A260529(n) = concatenation of the positions of digits 9, 8,..., 0 in the decimal representation of n, using 1 for the rightmost digit etc., skipping digits which don't occur.at n=22A260275
• Numbers n which divide A260521(n), the concatenation of the positions of the digits 9, 8, ..., 0 in the decimal representation of n, where positions are counted from the right, and 0 if a given digit does not occur.at n=45A260386
• a(n) = greatest k such that A155043(k+A262509(n)) < A155043(A262509(n)).at n=39A262909
• Isolated deficient numbers that are divisible by 3.at n=37A273255
• Composite numbers k such that phi(x) = psi(k)*phi(k) has no solution.at n=18A292714
• Lexicographically first sequence of distinct terms such that any set of five successive digits can be reordered as {d, d+1, d+2, d+3, d+4}, d being the smallest of the five digits.at n=37A302500
• Derangements of {1,2,...,n} (n >= 2) in lexicographic order.at n=15A320588