4064256

Appears in sequences

• Squares of even hexagonal numbers.at n=15A014772
• Row sums of triangle A110205, where A110205(n,k) equals the sum of cubes of numbers < 2^n having exactly k ones in their binary expansion.at n=5A110206
• A symmetrical binomial product triangle sequence:q=4; t(n,m,q)=If[n == 0 || n == 1, 1, Product[Binomial[n + i, m + i], {i, -Floor[q/2], Floor[q/2]}] + Product[Binomial[n + i, n - m + i], {i, -Floor[q/2], Floor[q/2]}]].at n=30A174149
• A symmetrical binomial product triangle sequence:q=4; t(n,m,q)=If[n == 0 || n == 1, 1, Product[Binomial[n + i, m + i], {i, -Floor[q/2], Floor[q/2]}] + Product[Binomial[n + i, n - m + i], {i, -Floor[q/2], Floor[q/2]}]].at n=33A174149
• Product of the nonzero digits (in base 10) of n^5.at n=7A218311
• Product of the nonzero digits (in base 10) of n^5.at n=27A218311
• Numbers k with the property that it is possible to write the base 2 expansion of k as concat(a_2,b_2), with a_2>0 and b_2>0 such that, converting a_2 and b_2 to base 10 as a and b, we have (a+b)^2 = k.at n=35A258844
• a(n) = the smallest number m such that gcd(tau(m), sigma(m)) = n where tau(k) = the number of the divisors of k (A000005) and sigma(k) = the sum of the divisors of k (A000203).at n=32A324554
• a(n) = Product_{d|n} lcm(tau(d), sigma(d)) where tau(k) is the number of divisors of k (A000005) and sigma(k) is the sum of divisors of k (A000203).at n=27A334806
• Sum of the divisors of the primorial inflation of n.at n=33A337203
• a(n) is the denominator of f(n)*conj(f(n)), where f(n) = Product_{k=1..n} (1/k + i), i is the imaginary unit, and conj(z) is the complex conjugate of z.at n=7A370556