395136

Appears in sequences

• Number of ways of writing n as a sum of 8 squares.at n=30A000143
• Theta series of D_8 lattice.at n=15A008430
• Fourier coefficients of E_{0,4}.at n=30A035016
• Numbers k such that, in the prime factorization of k, the product of exponents equals the product of prime factors.at n=27A054412
• Numbers k such that 1/(1/phi(k) + 1/phi(k+1) + 1/phi(k+2) + 1/phi(k+3)) is an integer.at n=28A073544
• 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=7A113620
• 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=19A122406
• a(n) = 6*(n - 3)*(n - 4)*2^(n-3)*n^(n-4).at n=4A232994
• The greedy sequence of real numbers at least 1 that do not contain any 7-term geometric progressions with integer ratio.at n=10A235058
• Numbers of the form i^j * j^k * k^i, where i,j,k > 1.at n=17A259406
• Numbers such that (sum + product) of all their prime factors equals (sum + product) of all exponents in their prime factorization.at n=32A272818
• Numbers m such that Product(1 + p_i) = Product(1 + e_i), where m = Product((p_i)^e_i).at n=39A272858
• Numbers m such that sigma(Product(p_j)) = sigma(Product(e_j)), where m = Product((p_i)^e_i) and sigma = A000203.at n=34A272859
• 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=15A276372
• a(n) = 2*(n-1)^3*n^2*(n+1).at n=7A292282
• a(n) = Product_{d|n} lcm(sigma(d), pod(d)) where sigma(k) is the sum of divisors of k (A000203) and pod(k) is the product of divisors of k (A007955).at n=13A334809
• 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=34A356433