268800

Appears in sequences

• Triangle of coefficients of certain exponential convolution polynomials.at n=24A048786
• Triangle read by rows: G(s, rho) = ((s-1)!/s)*Sum_{i=0..s-1} ((s-i)/i!)*(s*rho)^i.at n=31A122525
• a(n) = (n-2)^4 - a(n-1) - a(n-2), with a(1) = a(2) = 0.at n=30A152729
• Number of 2 X 2 matrices having all terms in {-n,...,0,...,n} and determinant >= 2n.at n=13A211152
• Integer areas of orthic triangles of integer-sided triangles.at n=19A230402
• Irregular triangle read by rows: T(n,k) = number of 2-packed n X n matrices with exactly k nonzero entries (0 <= k <= n^2).at n=41A230878
• Integer areas of the intangents triangle of integer-sided triangles.at n=31A231740
• Triangle read by rows: T(n,k) = k*(n-1)!*n^(n-k-1)/(n-k)!, 1 <= k <= n.at n=32A259334
• a(n) = sigma(sigma(p(n))) = sum of the divisors of the sum of the divisors of number of partitions of n.at n=42A280101
• Number of defective (binary) heaps on n elements where six ancestor-successor pairs do not have the correct order.at n=10A324067
• Integer areas of integer-sided triangles where the lengths of two of the sides are cubes.at n=6A329536
• Numbers that reach 1 under the iterations of the map k -> k/d(k) if d(k) | k, and k -> k otherwise, where d(k) is the number of divisors of k (A000005).at n=12A330816
• Least k whose set of divisors contains exactly n Pythagorean triples, or 0 if no such k exists.at n=38A334382
• Maximum difficulty level (see A361424 for the definition) for tiling an n X 2 rectangle with a set of integer-sided rectangles, rounded down to the nearest integer.at n=19A361426