3880800
domain: N
Appears in sequences
- Smallest number with exactly n^2 divisors.at n=17A061707
- Numbers k such that sigma(k) - usigma(k) > 3k.at n=23A063875
- Minimal numbers having in canonical prime factorization at least one factor p^e such that e+1 is not prime, p prime and e>0.at n=24A099317
- Terms in A005179 where prime signature differs from that of corresponding term in A038547.at n=23A122813
- Highly abundant numbers (A002093) that are not Harshad numbers (A005349).at n=20A128702
- G.f.: exp(x) = Product_{n>=1} [1 + a(2n-1)*x^(2n-1)/(2n-1)! + a(2n)*x^(2n)/(2n)! ].at n=12A137941
- T(n,k) = Sum of multinomial(n; n_1,n_2,...,n_k)^2, where the sum extends over all compositions (n_1,n_2,...,n_k) of n into exactly k nonnegative parts.at n=24A192722
- Number of n X 5 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=19A208139
- Number of 5Xn 0..1 arrays avoiding 0 0 1 and 0 1 1 horizontally and 0 0 1 and 1 0 1 vertically.at n=12A208144
- Highly composite numbers of class 3 (see comment in A275239).at n=36A275241
- Least number k such that the number of its divisors is n times the number of its prime factors, counted with multiplicity.at n=25A275819
- a(n) = Product_{d|n, d<n} A019565(A193231(d)).at n=51A293231
- The least number which can be represented as a product of the greatest number of distinct positive integers in exactly n ways.at n=28A338159
- Triangular array read by rows. T(n,k) is the number of ways to form an ordered pair of n-permutations and then choose a size k subset of its common descent set, n >= 0, 0 <= k <= max{0,n-1}.at n=25A362589
- Numbers of least prime signature (A025487) whose prime factorization has equal sum of even and odd exponents.at n=12A371600
- Numbers k where records occur for d(k)/d(k+1), where d(k) is the number of divisors of k (A000005).at n=36A372092
- Numbers whose cubes have more square divisors than the cube of any smaller number.at n=29A377141
- a(n) is the least exponential deficient number that has exactly n exponential abundant divisors.at n=26A389300