793800

Appears in sequences

• a(n) = A059366(n,n-3) = A059366(n,3) for n >= 3, where the triangle A059366 arises from the expansion of a trigonometric integral.at n=5A001756
• ((n+3)!/6)*product( 2*k+1, k=0..n).at n=4A014130
• Number of permutations of an n-set containing a 4-cycle.at n=10A029571
• Triangle T(m,s), m >= 0, 0 <= s <= m, arising in the computation of certain integrals.at n=39A059366
• Triangle T(m,s), m >= 0, 0 <= s <= m, arising in the computation of certain integrals.at n=41A059366
• Smallest order for which there are n nonisomorphic finite Hamiltonian groups, or 0 if no such order exists.at n=20A104453
• a(n) is the smallest number representable in exactly n ways as a sum of 2 powerful(1) numbers.at n=33A115354
• Even refactorable numbers k such that the number r of odd divisors and the number s of even divisors are both odd divisors of k and k is the first number for which the triple (r,s,t) occurs, where t is the number of divisors of k.at n=17A120358
• A certain partition array in Abramowitz-Stegun order (A-St order).at n=47A134144
• a(n) = n^2*(n+1)^2/2.at n=35A163102
• Coefficients in q-expansion of (E_2^2*E_4 - 2*E_2*E_6 + E_4^2)/1728, where E_2, E_4, E_6 are the Eisenstein series shown in A006352, A004009, A013973, respectively.at n=15A282099
• Denominators of the Kirchhoff sum index for the n-hypercube graph.at n=9A290345
• Triangle T(n,k) is the number of permutations on n elements with at least one k-cycle for 1 <= k <= n.at n=48A293211
• Triangular array of the number of binary, rooted, leaf-labeled tree topologies with n leaves and k cherries, n >= 2, 1 <= k <= floor(n/2).at n=18A306364
• Number of vertex labels congruent to 1 modulo 3 of level n of the irregular triangle A324246.at n=30A324040
• Numbers k such that k and the next two numbers after k with the same prime signature as k also have the same set of distinct prime divisors as k.at n=11A340303
• a(n) is the least exponential deficient number that has exactly n exponential abundant divisors.at n=12A389300