43243200

Appears in sequences

• 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=29A019505
• Distinct elements of A045948.at n=14A048148
• a(n) = (4*n+6)(!^4)/6(!^4).at n=6A051618
• Smallest number whose square is divisible by n!.at n=15A065887
• a(1) = 1, a(n) = a(n-1) times smallest divisor of n >= n^(1/2).at n=12A072489
• Least k such that n*prime(k) <= k*tau(k).at n=33A073066
• Highly composite numbers k such that 2*k is not a highly composite number.at n=19A073771
• Number of labeled cyclic subgroups of S_n having the maximum possible order.at n=14A074260
• Magic products of 6 X 6 multiplicative magic squares.at n=22A113026
• a(1) = 1. For n >= 2, a(n) = sum of the two (not necessarily distinct) earlier terms, a(j) and a(k), which maximizes d(a(j)+a(k)), where d(m) is the number of positive divisors of m. a(n) = the maximum (a(j)+a(k)) if more than one such sum has the maximum number of divisors.at n=32A115386
• a(1) = 1. For n >= 2, a(n) = sum of the two (not necessarily distinct) earlier terms, a(j) and a(k), which maximizes d(a(j)+a(k)), where d(m) is the number of positive divisors of m. a(n) = the minimum (a(j)+a(k)) if more than one such sum has the maximum number of divisors.at n=32A115387
• Triangle T(n,k) = n!/(k!*(n-3*k)!), for n >= 3*k >= 0, read by rows.at n=38A118394
• Triangle read by rows, the Bell transform of Product_{k=0..n} 7*k+1 without column 0.at n=22A132056
• a(n) is the largest highly composite number (definition 1) not a multiple of n.at n=32A134592
• a(n) is the largest highly composite number (definition 1) not a multiple of n.at n=15A134592
• Numbers k meeting the following criterion: if k is a multiple of d, then it is also a multiple of the smallest number with same number of divisors as d.at n=29A134865
• 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=32A136339
• Super least prime signatures; LCM of all signatures with n factors.at n=6A138534
• Subsequence of elements of A005179 that appear in A134865.at n=29A140753
• A product of quotients of factorials.at n=14A161887