41472

Appears in sequences

• Number of series-reduced trees with n nodes.at n=24A000014
• Highly powerful numbers: numbers with record value of the product of the exponents in prime factorization (A005361).at n=22A005934
• a(n) = 2^n*n^2.at n=9A007758
• a(n) = floor(n/5)*floor((n+1)/5)*floor((n+2)/5)*floor((n+3)/5)*floor((n+4)/5).at n=42A008382
• Theta series of lattice Kappa_8.at n=17A015235
• Numbers of form 2^i*9^j, with i, j >= 0.at n=47A025611
• Numbers of form 3^i*8^j, with i, j >= 0.at n=32A025615
• Numbers of form 8^i*9^j, with i, j >= 0.at n=17A025633
• Triangle whose (i,j)-th entry is binomial(i,j)*6^(i-j)*12^j.at n=13A038266
• Triangle whose (i,j)-th entry is binomial(i,j)*12^(i-j)*6^j.at n=11A038332
• Mean integral divisors associated with A048751.at n=8A048752
• If n = Product p_i^e_i then p_i < e_i (where e_i > 0) for all i.at n=37A054743
• If n = a + 10 * b + 100 * c + 1000 * d + ... then a(n) = (2^a) * (3^b) * (5^c) * (7^d) * ...at n=49A054842
• (Nearest integer to n^6/36) / 2.at n=11A061005
• Triangular array T(n,k) giving number of weakly connected digraphs with n labeled nodes and k arcs (n >= 1, 0 <= k <= n(n-1)).at n=50A062735
• Numbers k such that sigma(k) + tau(k) is a prime.at n=7A064205
• Numbers k such that sigma(k) - tau(k) is a prime.at n=8A065061
• Numbers k such that sigma(k) + tau(k) and sigma(k) - tau(k) are primes.at n=4A065116
• Maximal number of divisors of any n-digit number.at n=15A066150
• The prime factors of n are also prime factors of the decimal encoding (A067599) of the prime factorization of n.at n=34A067671