225000
domain: N
Appears in sequences
- Integers of the form Product p_j^k_j = Product k_j^p_j; p_j in A000040.at n=17A008478
- Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*12^j.at n=22A038254
- Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*5^j.at n=26A038331
- a(n) = (5*n+10)(!^5)/10(!^5), related to A052562 ((5*n)(!^5) quintic, or 5-factorials).at n=4A051691
- Numbers k such that, in the prime factorization of k, the product of exponents equals the product of prime factors.at n=23A054412
- Numbers whose 3 prime powers are a permutation of each other. Numbers with 3 distinct prime factors whose 3 exponents are a permutation of the 3 bases.at n=5A113620
- Numbers of the form Product_i b_i^e_i, where the b_i are all distinct values > 1 and the e_i are a permutation of the b_i.at n=36A122405
- 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=16A122406
- Numbers k such that k and k^2 use only the digits 0, 2, 5 and 6.at n=30A136911
- Numbers k such that k and k^2 use only the digits 0, 2, 5, 6 and 8.at n=48A136913
- Numbers k such that k and k^2 use only the digits 0, 2, 5, 6 and 9.at n=52A136914
- Numbers with prime factorization p^2*q^3*r^5 where p, q, and r are distinct primes.at n=10A190470
- Numbers n for which n*n'/(n+n') is an integer, where n' is the arithmetic derivative of n.at n=39A210935
- Expansion of ( f(-q)^12 + 22 * q * f(-q)^6 * f(-q^5)^6 + 125 * q^2 * f(-q^5)^12 ) / (f(-q) * f(-q^5))^2 in powers of q where f() is a Ramanujan theta function.at n=29A235870
- Number of (n+2) X (4+2) 0..3 arrays with every consecutive three elements in every row and column having exactly two distinct values, and in every diagonal and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=9A252691
- Numbers such that (sum + product) of all their prime factors equals (sum + product) of all exponents in their prime factorization.at n=27A272818
- Numbers m such that Product(1 + p_i) = Product(1 + e_i), where m = Product((p_i)^e_i).at n=31A272858
- Numbers m such that sigma(Product(p_j)) = sigma(Product(e_j)), where m = Product((p_i)^e_i) and sigma = A000203.at n=28A272859
- Numbers m such that the largest digit in the decimal expansion of 1/m is 4.at n=32A351470
- Numbers k such that, in the prime factorization of k, the least common multiple of the exponents equals the least common multiple of the prime factors.at n=29A356433