51499

Appears in sequences

• Number of partitions into pairs.at n=6A006198
• d(n,s) = number of perfect matchings on {1, 2, ..., n} with s short pairs.at n=29A079267
• Number of nX2 arrays containing 2 copies of 0..n-1 with no element 1 greater than its west, northeast or northwest neighbor modulo n and the upper left element equal to 0.at n=5A266992
• T(n,k)=Number of nXk arrays containing k copies of 0..n-1 with no element 1 greater than its west, northeast or northwest neighbor modulo n and the upper left element equal to 0.at n=26A266994
• Number of maximal matchings in the n-path complement graph.at n=12A302749
• Number of maximum matchings in the n-path complement graph.at n=12A302750