12310199
domain: N
Appears in sequences
- d(n,s) = number of perfect matchings on {1, 2, ..., n} with s short pairs.at n=45A079267
- Number of loopless linear chord diagrams with n chords.at n=9A278990
- Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=25A291843
- 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=37A293157
- Number of maximum matchings in the n-path complement graph.at n=17A302750
- Number of permutations of n copies of 1..9 introduced in order 1..9 with no element equal to another within a distance of 1.at n=1A321987
- 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=45A334059