111132

Appears in sequences

• Positive numbers n such that n is a multiple of (product of digits of n) * (sum of digits of n).at n=22A049102
• Sum of digits of zero-absent composite a(n) equals number of prime factors.at n=7A050690
• Numbers n such that n*sigma(n) is a perfect square.at n=22A069070
• a(n)=n^2 times nearest cube to n^2.at n=18A077112
• Non-perfect powers k for which q = A051903(k)/A051904(k) is an integer, A051904(k) > 1.at n=17A093770
• a(n) = n^4 + n^3 + n^2.at n=18A100019
• 7-smooth numbers containing only noncomposite digits (1,2,3,5,7).at n=46A113623
• Expansion of (eta(q^7) / eta(q))^4 in powers of q.at n=14A121593
• A001263 * A127773.at n=50A132819
• Floor(1/{(9+n^4)^(1/4)}), where {} = fractional part.at n=62A184633
• Triangle read by rows of products of (signless) Stirling numbers of the first kind (A132393) and Stirling numbers of the second kind (A008277).at n=30A187556
• a(n) = phi(n^4).at n=20A189393
• Numbers with prime factorization p^2*q^3*r^4 where p, q, and r are distinct primes.at n=14A190115
• Strong Achilles numbers: Achilles numbers m such that phi(m) is also an Achilles number, where phi(m) denotes Euler's totient function of m.at n=35A194085
• a(0)=0, a(1)=1, a(2n)=18*a(n), a(2n+1)=a(2n)+1.at n=28A197352
• Composite numbers whose product of digits is 6.at n=40A201055
• Number of length 1+5 0..n arrays with some three disjoint pairs in each consecutive six terms having the same sum.at n=10A248490
• Smallest k such that A261029(k) = n.at n=38A260935
• Triangle read by rows: T(n,k) = binomial(n,k)^2 * binomial(2*(n-k), n-k).at n=30A318397
• Numbers whose digit product equals the number of their digits.at n=23A321771