440192

Appears in sequences

• Two decks each have n kinds of cards, 2 of each kind. The first deck is laid out in order. The second deck is shuffled and laid out next to the first. A match occurs if a card from the second deck is next to a card of the same kind from the first deck. a(n) is the number of ways of achieving no matches.at n=5A000316
• Number of permutations with no hits on 2 main diagonals.at n=10A003471
• Penrice Christmas gift numbers, Card-matching numbers (Dinner-Diner matching numbers).at n=25A059057
• Card-matching numbers (Dinner-Diner matching numbers) for 5 kinds of cards.at n=7A059071
• Triangle read by rows: T(n,k) (n >= 1, 1 <= k <= n) = largest permanent of any n X n (0,1) matrix with k 1's in each row and column.at n=52A133644
• Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives numbers belonging to cycles, including fixed points.at n=24A165115
• Consider the base-9 Kaprekar map n->K(n) defined in A165110. Sequence gives numbers belonging to cycles of length greater than 1.at n=22A165117
• Number of (n+2)X3 0..3 arrays with every 2X2 subblock sum equal to some diagonal or antidiagonal neighbor 2X2 subblock sum.at n=2A187354
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 2X2 subblock sum equal to some diagonal or antidiagonal neighbor 2X2 subblock sum.at n=3A187356
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 2X2 subblock sum equal to some diagonal or antidiagonal neighbor 2X2 subblock sum.at n=5A187356
• Number of permutations p of [n] with no fixed points and cyclic displacement of elements restricted by four: p(i)<>i and (i-p(i) mod n <= 4 or p(i)-i mod n <= 4).at n=10A260092
• Multi-table menage numbers T(n,k) for n,k >= 1 equals the number of ways to seat the gentlemen from n*k married couples at n round tables with 2*k seats each such that (i) the gender of persons alternates around each table; and (ii) spouses do not sit next to each other; provided that the ladies are already properly seated (i.e., no two ladies sit next to each other).at n=16A277256
• Number of X-based filling of diagonals in a diagonal Latin square of order n with the main diagonal in ascending order.at n=10A337302
• Number of X-based filling of diagonals in a diagonal Latin square of order n with the main diagonal in ascending order.at n=11A337302
• Triangle read by rows of generalized ménage numbers: T(n,k) is the number of permutations pi in S_n such that pi(i) != i and pi(i) != i+k (mod n) for all i; n, 1 <= k < n.at n=40A354408
• Maximum value in the n-th row of A354408.at n=8A354409