35559

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=24A064022
• Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) >= number of distinct parts of p.at n=43A241821
• Numbers k with digits in nondecreasing order and each digit > 1 such that the iterated product of digits of k is a prime and k is the least positive integer with this property and its product of digits.at n=24A333960
• Expansion of e.g.f. exp( 3 * (1-sqrt(1-2*x)) ).at n=6A369746
• Numbers with multiplicative digital root of 5 that are free of 1s and have their digits in ascending order.at n=12A371561