1940400

Appears in sequences

• Smallest number with same number of divisors as n!.at n=10A045977
• Numbers k such that sigma(k) - usigma(k) > 3k.at n=5A063875
• Averages of twin prime pairs k such that k*11 and k/11 are squares.at n=1A154674
• Where records occur in A054025.at n=29A272720
• Highly composite numbers of class 4 (see comment in A275239).at n=37A275242
• Noninfinitary superabundant numbers: numbers m such that nisigma(m)/m > nisigma(k)/k for all k < m, where nisigma(m) is the sum of noninfinitary divisors of m (A348271).at n=13A348273
• Noninfinitary highly composite numbers: where the number of noninfinitary divisors (A348341) increases to a record.at n=32A348342
• Triangle read by rows: T(n,k) is the number of n-permutations whose fourth-shortest cycle has length exactly k; n >= 0, 0 <= k <= max(0,n-3).at n=45A350274
• Triangular array read by rows. T(n,k) is the number of sets of lists (as in A000262(n)) with exactly k size 2 lists, n >= 0, 0 <= k <= floor(n/2).at n=40A351823
• a(n) is the least number that has exactly 2^n squarefree divisors and exactly 2^n powerful divisors.at n=5A360903
• Expansion of e.g.f. exp(x^4/24 * (1+x)^4).at n=11A361569
• Least common multiple of the first n terms of A359804.at n=30A369685
• Triangle read by rows: T(n, k) = 4^n*Sum_{j=0..k} (-1)^(k - j)*binomial(k, j)* Pochhammer(j/4, n).at n=32A371026
• Numbers k where records occur for d(k)/d(k+1), where d(k) is the number of divisors of k (A000005).at n=33A372092
• Terms k in A025487 such that k-1 and k+1 are twin primes.at n=37A375197
• Numbers whose cubes have more square divisors than the cube of any smaller number.at n=28A377141
• a(n) is the least number that has exactly n exponential abundant divisors.at n=26A389299