750141

Appears in sequences

• Integers of the form Product p_j^k_j = Product k_j^p_j; p_j in A000040.at n=21A008478
• Numbers whose prime factors are 3 and 7.at n=33A033850
• Odd numbers divisible by exactly 10 primes (counted with multiplicity).at n=27A046323
• Numbers k such that, in the prime factorization of k, the product of exponents equals the product of prime factors.at n=30A054412
• a(n) = n^3 * 3^n.at n=7A062074
• Array A(n, k) = n^k * k^n, n, k >= 0, read by antidiagonals.at n=58A062275
• Product of gcd(k,n) for 1 <= k <= n.at n=20A067911
• Numbers of the form p^q * q^p, with distinct primes p and q.at n=5A082949
• Numbers of the form 3^p * p^3 for p prime.at n=3A097205
• a(n) = n^7 * 7^n.at n=3A098803
• Numbers whose prime factors are raised to the powers of each other.at n=5A113855
• Numbers of the form Product_i p_i^e_i, where the p_i are distinct primes and the e_i are a permutation of the p_i.at n=20A122406
• Numbers of the form j^k * k^j, where j,k > 1.at n=17A146748
• Write exp(-x) = Product_{n>=1} (1 + g_n x^n); a(n) = denominator(g_n).at n=20A170911
• Numbers of the form p^7*q^3 where p and q are distinct primes.at n=9A179705
• Numbers having factorization Product_{i=1..m} p(i)^e(i) such that m > 1 and p(i) + e(i) is the same for each i.at n=34A219302
• a(n) = 3^(n-1) * (n+1)^(n-3) * (n+3).at n=6A251583
• Numbers such that (sum + product) of all their prime factors equals (sum + product) of all exponents in their prime factorization.at n=36A272818
• Numbers m such that Product(1 + p_i) = Product(1 + e_i), where m = Product((p_i)^e_i).at n=43A272858
• Numbers m such that sigma(Product(p_j)) = sigma(Product(e_j)), where m = Product((p_i)^e_i) and sigma = A000203.at n=39A272859