55677

Appears in sequences

• a(n) is the smallest value of m such that prod(m) = n*length(m)*sum(m) where prod(m) is the product of the digits of m, length(m) is the number of digits of m, sum(m) is the sum of the digits of m; or 0 if no such m exists.at n=48A064022
• Number of (n+2) X (2+2) 0..3 arrays with every 3 X 3 subblock row and diagonal sum equal to 0 2 4 6 or 7 and every 3 X 3 column and antidiagonal sum not equal to 0 2 4 6 or 7.at n=8A252427
• Expansion of Product_{k>=1} ((1 + x^k) * (1 + 2*x^k)).at n=26A266819