415800

Appears in sequences

• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=37A059436
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=39A059436
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=35A059436
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=38A059436
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=34A059436
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=36A059436
• Fourth (unsigned) column of triangle A062138 (generalized a=5 Laguerre).at n=4A062150
• 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=35A062515
• Number of atoms in first n shells of type I hyperfullerene.at n=27A063497
• Number of permutations of {1,2,3,...,n} where the elements of n are considered indistinguishable if they differ by a power of 2 (for example 3, 12 and 24 are all considered equivalent).at n=11A067281
• Problem 66 in Knuth's Art of Computer Programming, vol. 4, section 7.2.1.5 asks which integer partition of n produces the most set partitions. The n-th term of this sequence is the number of set partitions produced by that integer partition.at n=12A102356
• Triangle read by rows: T(n,k) is the sum of the weights of all vertices labeled k at depth n in the Catalan tree (1 <= k <= n+1, n >= 0).at n=31A102625
• Partial products of largest prime factors of numbers <= n.at n=10A104350
• Sum of divisors of A104357(n) = A104350(n) - 1.at n=9A104362
• Euler's totient of A104365(n) = A104350(n) + 1.at n=10A104371
• Magic products of 5 X 5 multiplicative magic squares.at n=5A111031
• Numbers that are products of distinct primorial numbers (see A002110).at n=26A129912
• Coefficients of a partition transform for Lagrange inversion of -log(1 - u(.)*t), complementary to A134685 for an e.g.f.at n=35A133932
• Triangle read by rows: the k-th entry of row n is the number of particular connectivity requirements that a k-linked graph with n >= 2k vertices has to satisfy T(n,k) = (1/2) * n!/(k!*(n-2*k)!) where k runs from 1 to floor(n/2).at n=33A135610
• Least number k such that sigma_2(k) >= 2^n.at n=37A141847