1384448

Appears in sequences

• a(n) = 2^n*n^2.at n=13A007758
• Integers of the form Product p_j^k_j = Product k_j^p_j; p_j in A000040.at n=24A008478
• Droll numbers: numbers > 1 whose sum of even prime factors equals the sum of odd prime factors.at n=35A019507
• a(n) = T(n,2), array T as in A049600.at n=16A049611
• Numbers k such that, in the prime factorization of k, the product of exponents equals the product of prime factors.at n=34A054412
• Product of gcd(k,n) for 1 <= k <= n.at n=25A067911
• Numbers of the form p^q * q^p, with distinct primes p and q.at n=6A082949
• Binomial transform of binomial(n+2,2).at n=15A084851
• Numbers of the form p^2 * 2^p for p prime.at n=5A098096
• Numbers whose prime factors are raised to the powers of each other.at n=6A113855
• 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=23A122406
• Numbers of the form j^k * k^j, where j,k > 1.at n=18A146748
• Write exp(-x) = Product_{n>=1} (1 + g_n x^n); a(n) = denominator(g_n).at n=25A170911
• Records in A114183.at n=24A222193
• a(n) is the denominator of c(n), where c(n) is calculated from Product_{i>=1}(1-c(i)*x^i) = exp(-(x^2)/(1-x))*(1-x).at n=51A264859
• Numbers n such that, in the prime factorization of n, the list of the exponents is a rotation of the list of the prime factors.at n=19A276372
• Numbers k of the form p_1^p_m * p_2^p_(m-1) * ... * p_(m-1)^p_2 * p_m^p_1 for increasing primes p_i.at n=13A334633
• Row product of A374433.at n=26A374431