12612600

Appears in sequences

• 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=14A102356
• Denominators of exponential transform of 1/n.at n=14A177209
• a(n) = (4*n)! / (n!^4 * (n+1)).at n=4A207817
• a(n) = the smallest number k such that floor(Sum_{d|k} 1/tau(d)) = n.at n=27A265393
• Number of unrooted labeled trees on 4n+2 nodes with node degree either one or five.at n=3A274083
• If 2n = 2^e1 + 2^e2 + ... + 2^ek [e1 .. ek distinct], then a(n) = A002110(e1) * A002110(e2) * ... * A002110(ek).at n=41A283477
• Number of different numbers that are formed by permuting digits of n!.at n=16A309415
• Partition triangle read by rows. Number of ordered set partitions of the set {1, 2, ..., 2*n} with all block sizes divisible by 2.at n=40A327022
• Numbers with a record number of exponentially squarefree divisors.at n=28A365681
• The smallest number k for which exactly n of its divisors are digitally balanced numbers in base 3 (A049354).at n=27A372146
• Numbers that have more biquadratefree divisors than any smaller number.at n=26A377140
• Numbers k that have a record number of divisors d such that gcd(d, k/d) is an exponentially odd number (A268335).at n=26A377708
• Let D(k) = {d(k,i)}, i = 1,2,...,q be the set of q divisors of an integer k. a(n) is the smallest number k such that there exist exactly n distinct integers M, 1 < M <= k, where each set D(k) mod M = {0,1,2,...,M-1}.at n=33A379647