498960

Appears in sequences

• Highly composite numbers: numbers n where d(n), the number of divisors of n (A000005), increases to a record.at n=34A002182
• Where records occur in A038548.at n=31A004778
• One sixth of 9-factorial numbers.at n=4A035020
• a(n) is the minimal number of binary order n which has maximal number of divisors in this interval.at n=19A036484
• Largest number having binary order n (A029837) and of which the number of divisors is maximal in that range of g(k) = n.at n=19A036493
• Numbers with an increasing number of nonprime divisors.at n=41A059992
• Number of degree-n even permutations of order exactly 10.at n=10A061135
• 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=36A062515
• 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=32A065218
• Numbers k that are repdigits in more bases (smaller than k) than any smaller number.at n=33A066044
• Highly composite numbers k such that 2*k is not a highly composite number.at n=11A073771
• Number of labeled cyclic subgroups of S_n having the maximum possible order.at n=12A074260
• Triangle whose n-th row contains the n smallest numbers that are products of n distinct integers > 1, read by rows.at n=33A081957
• Triangle read by rows: T(n,k) = Sum_{i=k..n} i!*Stirling2(n,i), n >= 1, 1 <= k <= n.at n=32A084416
• Triangle read by rows: T(n,k)=sum((n+1-i)!*stirling2(n,n+1-i),i=1..k), n>=1, 1<=k<=n.at n=31A084417
• Sixth column (k=7) of array A090438 ((4,2)-Stirling2) divided by 48 = 4!*2.at n=2A091036
• Numbers n such that, for some numbers (j,k), j<=k, n is the smallest positive multiple of j (or more) of the first k positive integers.at n=38A094348
• Magic products of 5 X 5 multiplicative magic squares.at n=11A111031
• a(n) = denominator of sum of reciprocals of the terms of the continued fraction for H(n) = Sum_{k=1..n} 1/k.at n=38A112287
• a(1) = 1;l for n>1, a(n) = smallest number such that: 1. the number of divisors is strictly increasing, 2. the differences between the terms are nondecreasing.at n=36A137425