110880

Appears in sequences

• Highly composite numbers: numbers n where d(n), the number of divisors of n (A000005), increases to a record.at n=29A002182
• Superabundant [or super-abundant] numbers: n such that sigma(n)/n > sigma(m)/m for all m < n, sigma(n) being A000203(n), the sum of the divisors of n.at n=24A004394
• Where records occur in A038548.at n=26A004778
• Numbers k such that sigma(k)/phi(k) sets a new record.at n=23A018894
• a(1)=1; for n > 1, a(n) is the smallest number with the same number of divisors as 2*a(n-1).at n=19A019505
• Numbers k such that sigma(k) >= 4*k.at n=15A023198
• Floor( n(n+1)(n+2)...(n+7) / (n+(n+1)+(n+2)+...+(n+7)) ).at n=4A032777
• Integer quotients n(n+1)(n+2)...(n+7) / (n+(n+1)+(n+2)+...+(n+7)).at n=2A032779
• a(n) is the minimal number of binary order n which has maximal number of divisors in this interval.at n=17A036484
• Triangle read by rows. A generalization of unsigned Lah numbers, called L[4,1].at n=24A048854
• Expansion of e.g.f. (2-2*x-x^2)/((1-x)*(1-x-x^2)).at n=7A052660
• a(n) is the smallest number which has n consecutive divisors k, k+1, ..., k+n-1 such that the quotients all begin with the same digit.at n=5A053014
• Highest common factor of successive highly composite numbers (1), A002182.at n=35A054481
• Triangle read by rows: row n consists of the nonzero coefficients of the expansion of 2^n x^n in terms of Hermite polynomials with decreasing subscripts.at n=45A059344
• Numbers with an increasing number of nonprime divisors.at n=35A059992
• a(n) = !n*n!.at n=6A061640
• Smallest number with exactly n^2 divisors.at n=11A061707
• Consider the subsets of proper divisors of a number that sum to the number. These are numbers that set a record number of such subsets.at n=27A065218
• Numbers k that are repdigits in more bases (smaller than k) than any smaller number.at n=28A066044
• a(n) = Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=3.at n=37A068020