1081080

Appears in sequences

• a(n) = (n+1)*(2*n)!/(2^n*n!) = (n+1)*(2n-1)!!.at n=7A001193
• Highly composite numbers: numbers n where d(n), the number of divisors of n (A000005), increases to a record.at n=38A002182
• Denominator in Feinler's formula for unsigned Bernoulli number |B_{2n}|.at n=38A002444
• Where records occur in A038548.at n=35A004778
• 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=23A019505
• Number of compositions of n into 9 ordered relatively prime parts.at n=17A023034
• a(n) = 14*(n+1)*binomial(n+4,8).at n=7A027804
• a(n) = 30*(n+1)*binomial(n+4,10).at n=5A027806
• Smallest number with 2^n divisors.at n=8A037992
• Triangle T(m,s), m >= 0, 0 <= s <= m, arising in the computation of certain integrals.at n=37A059366
• Smallest number with exactly n^2 divisors.at n=15A061707
• 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=33A062515
• 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=37A065218
• Smallest number with exactly A025475(n) divisors.at n=16A065743
• Numbers k that are repdigits in more bases (smaller than k) than any smaller number.at n=37A066044
• LCM of numbers <= n and having a factor in common with n.at n=38A066574
• LCM of numbers m such that 1 <= m <= n, m has a common factor with n, but m does not divide n.at n=38A066575
• a(1) = 1; a(n) = n*a(n-1) if n does not divide a(n-1), otherwise a(n) = a(n-1).at n=14A066616
• a(1) = 1; a(n) = n*a(n-1) if n does not divide a(n-1), otherwise a(n) = a(n-1).at n=13A066616
• a(1) = 1; a(n) = n*a(n-1) if n does not divide a(n-1), otherwise a(n) = a(n-1).at n=12A066616