172972800

Appears in sequences

• State assignments for n-state machine.at n=7A007041
• Denominator of Sum_{k=0..n} (-1)^k/k!.at n=13A053556
• Triangle T(n,m) of number of labeled m-node T_0-hypergraphs with n hyperedges (empty hyperedges and multiple hyperedges included), m=0,1,...,2^n.at n=28A059584
• Smallest number whose square is divisible by n!.at n=16A065887
• Denominator of B(2n)*H(2n)/n where B(k) is the k-th Bernoulli number and H(k) the k-th harmonic number.at n=7A083688
• a(n)=Max{ (i+j)!/i!^2 | 0<=i,j<=n }.at n=10A096769
• 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=34A115386
• 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=34A115387
• a(n) = (2*n+1)!*(2*n+3)/3.at n=5A165457
• Bi-unitary multiperfect numbers.at n=26A189000
• Number of relaxed compacted binary trees of right height at most one with minimal sequences between branch nodes except after the last branch node on level 0.at n=11A288953
• Alphabetic length of a divide-and-conquer approach to the regular expression for permutations of n symbols.at n=15A320460
• Expansion of e.g.f. exp( Sum_{k>=0} x^(5*k+4) / (5*k+4) ).at n=13A365989