37879808

Appears in sequences

• a(n) = 2^n*n^2.at n=17A007758
• Integers of the form Product p_j^k_j = Product k_j^p_j; p_j in A000040.at n=33A008478
• Product of gcd(k,n) for 1 <= k <= n.at n=33A067911
• 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=10A071837
• Numbers of the form p^q * q^p, with distinct primes p and q.at n=7A082949
• Third column of A059450.at n=20A086866
• Numbers of the form p^2 * 2^p for p prime.at n=6A098096
• Numbers whose prime factors are raised to the powers of each other.at n=7A113855
• Number of functions f:[n]->[n] such that f[(2*x) mod n]=[2*f(x)] mod n for all x in [n], for n=1,2,3,... Here [n] denotes {0,1,2,...,n-1}.at n=33A117987
• 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=31A122406
• Numbers of the form j^k * k^j, where j,k > 1.at n=26A146748
• Write exp(-x) = Product_{n>=1} (1 + g_n x^n); a(n) = denominator(g_n).at n=33A170911
• Integers of the form 2^p*p^2 where p is the lesser of a pair of twin primes.at n=3A240983
• 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=23A276372
• 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=17A334633
• Row product of A374433.at n=34A374431