247808

Appears in sequences

• a(n) = 2^n*n^2.at n=11A007758
• Integers of the form Product p_j^k_j = Product k_j^p_j; p_j in A000040.at n=18A008478
• Droll numbers: numbers > 1 whose sum of even prime factors equals the sum of odd prime factors.at n=21A019507
• Numbers whose prime factors are 2 and 11.at n=35A033848
• Numbers k such that, in the prime factorization of k, the product of exponents equals the product of prime factors.at n=24A054412
• Product of gcd(k,n) for 1 <= k <= n.at n=21A067911
• Numbers k with the property that in the prime factorization of k all prime exponents are prime, their sum is also prime and equals the sum of distinct prime factors of k.at n=7A071837
• a(n)=n^2 times nearest cube to n^2.at n=22A077112
• Numbers of the form p^q * q^p, with distinct primes p and q.at n=4A082949
• Numbers of the form p^2 * 2^p for p prime.at n=4A098096
• a(n) = 11^n * n^11.at n=2A098880
• This list of numbers a(i) has the property that every left-subset of length n > 0 of the numbers a(i) is divisible by i+n and are the largest such integers for every i.at n=11A113538
• Numbers whose prime factors are raised to the powers of each other.at n=4A113855
• 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=17A122406
• Numbers of the form j^k * k^j, where j,k > 1.at n=14A146748
• Write exp(-x) = Product_{n>=1} (1 + g_n x^n); a(n) = denominator(g_n).at n=21A170911
• Numbers such that the sum of the cube of the odd divisors is prime.at n=32A195332
• 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=31A219302
• Numbers k such that sigma(k) + tau(k) + phi(k) is a prime, where sigma(k) = A000203(k), tau(k) = A000005(k) and phi(k) = A000010(k).at n=24A229265
• Integers of the form 2^p*p^2 where p is the lesser of a pair of twin primes.at n=2A240983