68086

Appears in sequences

• Obtain m by omitting trailing zeros from n; a(n) = smallest multiple k*m which is a palindrome with even digits, or -1 if no such multiple exists.at n=59A061915
• Smallest multiple k*n of n which has even digits and is a palindrome or becomes a palindrome when 0's are added on the left (e.g., 10 becomes 010, which is a palindrome).at n=59A062293
• Palindromes whose smallest palindromic proper multiple is the number concatenated with itself.at n=17A119368
• Number of distinct solutions of sum{i=1..3}(x(2i-1)*x(2i)) = 1 (mod n), with x() only in 2..n-2.at n=22A180826
• Number of (n+1) X (1+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=3A234659
• Number of (n+1) X (4+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=0A234662
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=6A234665
• T(n,k) is the number of (n+1) X (k+1) 0..6 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=9A234665
• Cyclops numbers with circular digits {0,6,8,9}.at n=22A274765
• Number of step shifted (decimated) sequence structures of length n using an infinite alphabet.at n=10A288621
• The smallest palindrome with exactly n circular loops (or holes) in its decimal representation.at n=7A337842