972000

Appears in sequences

• Highly powerful numbers: numbers with record value of the product of the exponents in prime factorization (A005361).at n=34A005934
• a(n) = Product_{i=0..7} floor((n+i)/8).at n=45A009694
• Nearest integer to n^5/25.at n=29A061003
• a(n) = n^3*6^n.at n=5A128792
• Totally multiplicative sequence with a(p) = 6*(p+3) for prime p.at n=23A167325
• Prime encoded sequence of generic integer partitions of n in the antilexicographic order of the partitions.at n=26A182911
• Number of Euler tours of the complete digraph on n vertices.at n=3A232545
• a(n) is the denominator of c(n), where c(n) is calculated from Product_{i>=1}(1-c(i)*x^i) = exp(-(x^2)/(1-x))*(1-x).at n=29A264859
• LB numbers: positive integers of the form m = a*10^k+b (with a > 0 and b < 10^k) satisfying two properties: 1) the set of prime factors of m is the union of the sets of prime factors of a and b; and 2) A001222(m) = A001222(a) + A001222(b).at n=31A267856
• Number of nX2 arrays containing 2 copies of 0..n-1 with column sums equal.at n=5A268470
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with column sums equal.at n=26A268472
• a(n) = Product_{d|n, d<n} A276086(d).at n=44A319708
• a(n) = A283980(A025487(n)).at n=36A330681
• Numbers k such that both k and sigma(k)=A000203(k) are powerful, i.e., are terms of A001694.at n=10A337044
• Indecomposable sigma-powerful numbers: powerful numbers k such that sigma(k) is also powerful, but restricted to terms that are not the product of 2 terms > 1 of A337044.at n=6A337045
• Positions of records in A116488.at n=40A342869
• Numbers with a record number of divisors that are both coreful and bi-unitary.at n=13A363333
• Numbers k in A376936 that set records in A379552.at n=8A379553