30375

Appears in sequences

• Permanent of Schur's matrix of order 2n+1.at n=7A003112
• Numbers of the form 3^i*5^j with i, j >= 0.at n=38A003593
• Integers of the form Product p_j^k_j = Product k_j^p_j; p_j in A000040.at n=12A008478
• Triangle of coefficients in expansion of (3+5x)^n.at n=23A013622
• Numbers whose prime factors are 3 and 5.at n=22A033849
• Number of labeled trees with 3-colored nodes.at n=5A038062
• Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*3^j.at n=25A038245
• a(1)=8; if n = Product p_i^e_i, n > 1, then a(n) = Product p_{i+1}^{e_i+2}.at n=23A045971
• Odd numbers divisible by exactly 8 primes (counted with multiplicity).at n=7A046321
• A convolution triangle of numbers generalizing Pascal's triangle A007318.at n=23A049326
• a(n) = n^(n+2)*(n+2)^n.at n=3A051490
• Numbers k such that Sum_{j} p_j = Sum_{j} e_j where Product_{j} p_j^(e_j) is the prime factorization of k.at n=29A054411
• Numbers k such that, in the prime factorization of k, the product of exponents equals the product of prime factors.at n=13A054412
• Nearest integer to n^5/25.at n=14A061003
• a(n) = n^3 * 3^n.at n=5A062074
• a(n) = (2n-1)^n * n^(2n-1).at n=2A062076
• a(n) = prime(n)^n * n^prime(n).at n=2A062082
• Array A(n, k) = n^k * k^n, n, k >= 0, read by antidiagonals.at n=41A062275
• Array A(n, k) = n^k * k^n, n, k >= 0, read by antidiagonals.at n=39A062275
• Product of gcd(k,n) for 1 <= k <= n.at n=14A067911