166320

Appears in sequences

• Highly composite numbers: numbers n where d(n), the number of divisors of n (A000005), increases to a record.at n=30A002182
• Denominators of coefficients for numerical differentiation.at n=10A002548
• 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=25A004394
• Where records occur in A038548.at n=27A004778
• Numbers k such that sigma(k) >= 4*k.at n=26A023198
• Smallest number with same number of divisors as n!.at n=9A045977
• Highest common factor of successive highly composite numbers (1), A002182.at n=33A054481
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=27A059436
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=26A059436
• Triangle T(n,k) = coefficient of x^n*y^k/(n!*k!) in 1/(1-x-y-x*y), read by rows in order 00, 10, 01, 20, 11, 02, ...at n=39A059446
• Triangle T(n,k) = coefficient of x^n*y^k/(n!*k!) in 1/(1-x-y-x*y), read by rows in order 00, 10, 01, 20, 11, 02, ...at n=41A059446
• Numbers with an increasing number of nonprime divisors.at n=37A059992
• Triangle T(n,k) = number of degree-n permutations with k even cycles, k=0..n.at n=46A060523
• 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=28A065218
• Numbers k that are repdigits in more bases (smaller than k) than any smaller number.at n=29A066044
• Numbers k such that sigma(k) > 4*k.at n=24A068404
• a(n) = (2*n+2)*(2*n+3)*(2*n+4) = 24*A000330(n+1).at n=26A069074
• Denominators of coefficients in -log(1+x)log(1-x) power series.at n=5A069685
• Least k such that n*prime(k) <= k*tau(k).at n=10A073066
• Numbers m such that sigma(m)/m is equal to sigma(k)/k for some k being superabundant (A004394).at n=42A073349