917280

Appears in sequences

• Number of divisors of n!.at n=28A027423
• Number of k's such that A002034(k) = n.at n=28A038024
• There exists some k>0 such that n is the product of (k + digits of n).at n=26A055482
• Number of divisors of n! that are coprime to n.at n=28A095997
• Numbers n such that n=(d_1+6)*(d_2+6)*...*(d_k+6) where d_1 d_2 ... d_k is the decimal expansion of n.at n=5A097372
• Highly abundant numbers (A002093) that are not Harshad numbers (A005349).at n=13A128702
• Numbers equal to the product of (each of its decimal digits, plus the number of decimal digits).at n=8A172415
• a(n) = Product_{k=0..n} binomial(k^2,k).at n=4A272094
• Highly composite numbers of class 6 (see comment in A275239).at n=33A275244
• Square array A(n,k) (n>=1, k>=1) read by antidiagonals: A(n,k) is the number of n-colorings of the Möbius ladder M_k on 2k vertices.at n=51A277444
• Number of minimum total dominating sets in the n-triangular honeycomb bishop graph.at n=12A304564
• Positions of records in A306440.at n=18A307221
• Triangular array read by rows: row n shows the coefficients of this polynomial of degree n: p(x,n) = 2^(n-1) ((x+r)^n - (x+s)^n)/(r - s), where r = 2 and s = 1/2.at n=39A327317
• a(n) is the lowest nonnegative exponent k such that n!^k is the product of the divisors of n!.at n=28A344687
• a(n) = sigma_2(n) * sigma_3(n).at n=14A379814
• Numbers k for which sigma(k - x) + sigma(k + x) = 9*k has at least one nonnegative solution.at n=5A385075