105210

Appears in sequences

• Vampire numbers (definition 2): numbers n with an even number of digits which have a factorization n = i*j where i and j have the same number of digits and the multiset of the digits of n coincides with the multiset of the digits of i and j.at n=9A014575
• Least common multiple of all cycle sizes in range [A014137(n-1)..A014138(n-1)] of permutation A130369/A130370.at n=7A130379
• Subset of A020342 (vampire numbers, definition 1) listing numbers which have more than one such representation of the desired form.at n=19A144563
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, -1, 0), (-1, 1, 0), (0, 0, -1), (0, 1, 0), (1, 0, 1)}.at n=9A150248
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (-1, 1), (0, -1), (0, 1), (1, -1), (1, 1)}.at n=9A151478
• Vampire numbers permutations of whose digits are other vampire numbers.at n=3A167266
• Triangle, read by rows, T(n,k) = binomial(n+k+1, n+1) * Sum_{j=0..k} j!*binomial(n,j)*binomial(k, j).at n=19A176121
• a(n) = A327005(n, n).at n=10A327006
• a(n) = Sum_{k=0..floor(n/3)} binomial(2*n-2*k+1,n-3*k).at n=9A371842