8890560

Appears in sequences

• Let M_n be the n X n matrix with M_n(i,j)=1/(i+j+3); then a(n)=1/det(M_n).at n=2A069642
• Triangle a(n,k) read by rows: product s(n,k)*s(n+1,k+1) of Stirling numbers of the first kind.at n=41A187558
• Number of ways to form k labeled groups, each with a distinct leader, using n people. Triangle T(n,k) = n!*k^(n-k)/(n-k)! for 1 <= k <= n.at n=42A199673
• Triangle with entry a(n,m) giving the total number of bracelets of n beads (D_n symmetry) with n colors available for each bead, but only m distinct colors present, with m from {1, 2, ..., n} and n >= 1.at n=41A214306
• Triangular array read by rows: T(n,k) is the number of simple labeled graphs on n nodes with unicyclic components having exactly k nodes with degree 1; n>=3, 0<=k<=n-3.at n=26A217763
• Number of permutations sigma of [n] such that k * sigma(k) >= n for 1 <= k <= n.at n=13A330432