39316

Appears in sequences

• Let S be a strictly monotonic sequence of length 2n and let p and q be subsequences of S each of length n such that the least element belongs to p and every element of S belongs to either p or q. The number of ways to select p such that for any index i the exchange of p(i) and q(i) makes at least one of p and q non-monotonic, is given by a(n).at n=10A137398
• Number of ways to place 6n nonattacking kings on a 12 X 2n cylindrical chessboard.at n=3A194648
• Number of ways to place 4n nonattacking kings on a vertical cylinder 8 X 2n.at n=5A195592
• Number of nonnegative integer arrays of length n summing to n without adjacent equal values.at n=13A221235
• Intersection of A361073 and 2 * A361611.at n=36A361215