37837800

Appears in sequences

• Multinomial coefficients (0, 1, ..., n)! = C(n+1,2)!/(0!*1!*2!*...*n!).at n=5A022915
• a(n) = n!/(1!*2!*3!*...*k!) where k is the largest integer such that 1!*2!*3!*...*k! divides n!.at n=14A074199
• Triangle read by rows: T(0,0) = 1, T(n,k) = Sum_{j=max(0,1-k)..n-k} (2^j)*(binomial(k+j,1+j) + binomial(k+j+1,1+j))*T(n-1,k-1+j).at n=34A085734
• Sum of all n-digit highly composite numbers.at n=6A127390
• Triangle T(n,k) read by rows = number of partitions of n-set into k blocks with distinct sizes, k = 1..A003056(n).at n=44A131632
• Triangular array T(n,k) n,k>=0 is the number of k letter words formed using at most 1a,2b's,3c's,...,n#'s.at n=39A172528
• Triangular array T(n,k) n,k>=0 is the number of k letter words formed using at most 1a,2b's,3c's,...,n#'s.at n=40A172528
• Members m of A025487 such that, if k appears in m's prime signature, k-1 appears at least as often as k (for any integer k > 1).at n=33A182863
• Triangular array read by rows: T(n,k) is the number of set partitions of {1,2,...,n} that have exactly k distinct block sizes.at n=44A208437
• T(n,k) is the number of size k ordered submultisets of the regular multiset {1_1,1_2,...,1_(n-1),1_n, ... ,i_1,i_2,...,i_(n-1),i_n, ... ,n_1,n_2,...,n_(n-1),n_n} (which contains n copies of i for 1 <= i <= n).at n=32A234574
• Number of compositions of n in which each part p has multiplicity p.at n=55A242434
• Number of compositions of n into exactly five different parts with distinct multiplicities.at n=0A246232
• a(n) = f(5*n)/(f(n-2)*f(n-1)*f(n)*f(n+1)*f(n+2)), where f(k) = k!.at n=1A248709
• a(n) = f(6*n+3)/(f(n-2)*f(n-1)*f(n)*f(n+1)*f(n+2)*f(n+3)), where f(k) = k!.at n=0A248710
• Triangle read by rows: T(m,n) = number of ways of distributing n distinguishable balls into m distinguishable bins of size 4 where empty bins are permitted (m >= 1, 1 <= n <= 4m).at n=37A248846
• Number T(n,k) of partitions of an n-set with distinct block sizes and maximal block size equal to k; triangle T(n,k), k>=0, k<=n<=k*(k+1)/2, read by columns.at n=25A262078
• Number of set partitions of [n] into five blocks with distinct sizes.at n=0A272517
• If 2n = 2^e1 + 2^e2 + ... + 2^ek [e1 .. ek distinct], then a(n) = A002110(e1) * A002110(e2) * ... * A002110(ek).at n=42A283477
• Maximum value of the multinomial coefficients M(n;lambda), where lambda ranges over all partitions of n into distinct parts.at n=15A290517
• 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=41A327022