721315

Appears in sequences

• Bessel polynomial y_n(-1).at n=8A000806
• d(n,s) = number of perfect matchings on {1, 2, ..., n} with s short pairs.at n=36A079267
• Write exp(sqrt(1+x)-1) = Sum c(n) x^n/n!; then a(n) = numerator of c(n).at n=9A101683
• Number of permutations of n copies of 1..8 introduced in order 1..8 with no element equal to another within a distance of 1.at n=1A190932
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no equal horizontal or antidiagonal neighbors and new values introduced sequentially from 0.at n=43A265192
• Number of loopless linear chord diagrams with n chords.at n=8A278990
• Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=20A291843
• Triangle read by rows: T(n,k) = number of linear chord diagrams with n chords such that every chord has length at least k (1 <= k <= n).at n=29A293157
• Number of maximum matchings in the n-path complement graph.at n=15A302750
• Square array A(n,k), n >= 1, k >= 1, read by antidiagonals, where A(n,k) is the number of permutations of n copies of 1..k introduced in order 1..k with no element equal to another within a distance of 1.at n=37A322013
• Triangle read by rows: T(n,k) is the number of perfect matchings on {1, 2, ..., 2n} with k disjoint strings of adjacent short pairs.at n=36A334059