83160

Appears in sequences

• a(n) = (6*n)!/((n!)^3*(3*n)!).at n=2A001421
• Highly composite numbers: numbers n where d(n), the number of divisors of n (A000005), increases to a record.at n=28A002182
• Where records occur in A038548.at n=25A004778
• Number of singular 2 X 2 matrices over Z(n) (i.e., with determinant = 0).at n=35A020478
• Numbers k such that sigma(k) >= 4*k.at n=8A023198
• Smallest number with 2^n divisors.at n=7A037992
• Numbers k such that phi(k) is equal to A008473(k).at n=15A039779
• Smallest x such that sigma(x) = n*phi(x), or -1 if no such x exists.at n=19A055234
• Leading least prime signatures: a(n) is in A025487 but a(n)/2 is not.at n=27A056153
• a(n) = Product_{k|n} (n+1-k).at n=11A056819
• Irregular triangle read by rows: T(n,k) = number of elements of order k in symmetric group S_n, for n >= 1, 1 <= k <= g(n), where g(n) = A000793(n) is Landau's function.at n=54A057731
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=21A059436
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=20A059436
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=22A059436
• Numbers with an increasing number of nonprime divisors.at n=34A059992
• Number of degree-n permutations of order exactly 6.at n=8A061121
• Leading least prime signatures, ordered by forming the product of primorials greater than 2 with multiplicities given by the canonical sequence of partitions.at n=22A062515
• a(1) = 1; a(n) > 0; for each k from 1 to n, k divides a(n) or a(n)+1 and a(n) is the least such integer.at n=14A064219
• a(1) = 1; a(n) > 0; for each k from 1 to n, k divides a(n) or a(n)+1 and a(n) is the least such integer.at n=13A064219
• 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=26A065218