122522400

Appears in sequences

• Product of first n nonzero Fibonacci numbers F(1), ..., F(n).at n=10A003266
• a(n) is the least k with sigma(k) >= n*k.at n=4A023199
• a(n) is the minimal number of binary order n which has maximal number of divisors in this interval.at n=27A036484
• 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=27A036493
• Numbers k such that, for all m < k, d_i(k) <= d_i(m) for i=1 to Min(d(k),d(m)), where d_i(k) denotes the i-th smallest divisor of k.at n=28A094783
• Deeply composite numbers: numbers n where sigma_k(n) increases to a record for all sufficiently low (i.e., negative) values of k.at n=35A095848
• Numbers j where sigma_k(j) increases to a record for all real values of k.at n=31A095849
• a(n) = Product_{1<=k<=n, GCD(k,n)=1} F(k), where F(k) is the k-th Fibonacci number.at n=10A111119
• a(n) = least number m such that sigma(m)/m > n, where sigma(m) = sum of divisors of m.at n=5A134716
• Largest highly composite number <= 2*a(n-1).at n=30A135614
• a(1) = 1; for all n >= 2, we choose a(n) to be as small as possible so that for all i = 1, ..., n, the sequence of the i-th divisors of a(1), a(2), ..., a(n) is nonincreasing.at n=34A136339
• Numbers n such that n, 2n, 3n are all highly composite numbers.at n=19A143770
• Dividends where Fibonacci products/sums yield integral quotients.at n=1A159950
• Superabundant numbers (A004394) that are not colossally abundant (A004490).at n=29A189228
• LCM of the first few p-smooth numbers for a prime number p if in A007416; otherwise smallest number with same number of divisors (see example for details).at n=19A212654
• Numbers k such that sigma(k) > 5*k.at n=0A215264
• Maximum number of binary strings of length 2n obtained from a partition of n.at n=17A247651
• Positions of records in A266342.at n=19A266343
• a(n) is the largest number k such that the sum of divisors of k does not exceed the n-th power of the number of divisors of k.at n=2A275026
• Primitive 5-abundant numbers: Numbers k such that sigma(k) > 5k (A215264) all of whose proper divisors d are 5-deficient numbers (having sigma(d) < 5d).at n=0A307115