120600

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=18A014575
• a(0) = 1; a(n+1) = Sum_{k=0..n} a(n-k)*a(floor(k/2)).at n=17A127680
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=11.at n=22A135196
• Subset of A020342 (vampire numbers, definition 1) listing numbers which have more than one such representation of the desired form.at n=30A144563
• Riordan array (1/(1-10*x-10*x^2), x/(1-10*x-10*x^2)).at n=23A206819
• Number of (n+2)X(2+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 3 4 6 or 7.at n=5A252124
• Number of (n+2)X(6+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 3 4 6 or 7.at n=1A252128
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 3 4 6 or 7.at n=22A252130
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not equal to 0 3 4 6 or 7 and every 3X3 diagonal and antidiagonal sum equal to 0 3 4 6 or 7.at n=26A252130