73080

Appears in sequences

• Number of planted binary phylogenetic trees with n labels.at n=7A006678
• Theta series of D_6 lattice.at n=34A008428
• a(n) = floor(n*(n-1)*(n-2)*(n-3)/9).at n=30A011919
• Maximization of sums of cubes of integer differences (b_[ i ]-i)^3 over permutations {b_[ i ], for i-1,2,...,n} on first n integers.at n=37A049031
• a(n) = (n/2)*(n + 1)*(3*n + 11).at n=34A059997
• Index values for new maxima in sequence A007365.at n=40A065932
• Numbers that can be expressed as the difference of the squares of primes in exactly ten distinct ways.at n=3A092006
• Triangle read by rows in which row n gives coefficients of polynomial R_n(y) that satisfies R_n(1/2) = 4^n, where R_n(y) forms the initial (n+1) terms of g.f. A077860(y)^(n+1).at n=33A097179
• Number of rhombus tilings of a hexagon with all sides of length 2n which contain the rhombus above and next to the center of the hexagon.at n=1A099112
• The triangle T_2(n, m), where T_2(n, m) is the number of surjective multi-valued functions from {1, 1, 2, 3, ..., n-1} to {1, 2, 3, ..., m} by rows (n >= 1, 1 <= m <= n).at n=34A172106
• Numbers with prime factorization p*q*r*s^2*t^3 (where p, q, r, s, t are distinct primes).at n=16A190111
• Number of 3 X n 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 1 1 vertically.at n=10A207929
• a(n) = lcm(n,p1,p2,...,pk) for such a partition of n which maximizes this value among all partitions {p1+p2+...pk} of n.at n=29A225646
• Sum of entries in the first cycles of all permutations of [n].at n=6A284816
• Sum T(n,k) of the entries in the k-th cycles of all permutations of [n]; triangle T(n,k), n>=1, 1<=k<=n, read by rows.at n=21A285439
• Triangle read by rows: T(n,k) is the number of achiral loops (necklaces or bracelets) of length n using exactly k different colors.at n=61A305540
• Irregular triangle read by rows: T(n,k) is the number of primitive (period n) periodic palindromes using exactly k different symbols, 1 <= k <= 1 + floor(n/2).at n=61A327878
• E.g.f. satisfies A(x) = 1/(1 - x)^(x * A(x)^2).at n=7A356795
• T(n, k) = Sum_{m = 0..n-1} Stirling1(m+1, k)*binomial(n, m)*(-1)^(n + k), where "Stirling1" are the signed Stirling numbers of the first kind.at n=51A367198
• Expansion of e.g.f. -x * log(4 - 3*exp(x)).at n=6A367490