cp's OEIS Frontend

Let M_n be the symmetrical n X n matrix M_n(i,j)=1/min(i,j); then for n>=0 det(M_n)=(-1)^(n-1)/a(n-1). - Benoit Cloitre, Apr 27 2002

If n women and n men are to be seated around a circular table, with no two of the same sex seated next to each other, the number of possible arrangements is a(n-1). - Ross La Haye, Jan 06 2009

a(n-1) is also the number of (directed) Hamiltonian cycles in the complete bipartite graph K_{n,n}. - Eric W. Weisstein, Jul 15 2011

a(n) is also number of ways to place k nonattacking semi-bishops on an n X n board, sum over all k>=0 (for definition see A187235). - Vaclav Kotesovec, Dec 06 2011

a(n) is number of permutations of {1,2,3,...,2n} such that no odd numbers are adjacent. - Ran Pan, May 23 2015

a(n) is number of permutations of {1,2,3,...,2n+1} such that no odd numbers are adjacent. - Ran Pan, May 23 2015

a(n-1) is the number of elements of the wreath product of S_n and S_2 with cycle partition equal to (2n), where S_n is the symmetric group of order n. - Josaphat Baolahy, Mar 12 2024

The old name of this sequence was wrong. It was corrected by Vaclav Kotesovec, Feb 19 2011. Kotesovec remarks that the maximal number of nonattacking bishops on an n X n board is 2n-2, and there are 2^n ways to place them. See the Kotesovec link.

Number of permutations with n cycles on a set of size 2n.

An analog of the Stirling numbers of the first kind, A008275.

A permutation p of the set {1,2,...,n} is called a parity-preserving permutation if p(i) = i (mod 2) for i = 1,2,...,n. The set of all such permutations forms a subgroup of order A010551 of the symmetric group on n letters. This triangle gives the number of parity preserving permutations of the set {1,2,...,n} with exactly k cycles. An example is given below.

If we write a parity-preserving permutation p in one line notation as ( p(1) p(2) p(3)... p(n) ) then the first entry p(1) is odd and thereafter the entries alternate in parity. Thus the permutation p belongs to the set of parity-alternate permutations studied by Tanimoto.

The row generating polynomials form the polynomial sequence x, x^2, x^2*(x + 1), x^2*(x + 1)^2, x^2*(x + 1)^2*(x + 2), x^2*(x + 1)^2*(x + 2)^2, .... Except for differences in offset, this triangle is the Galton array G(floor(n/2),1) in the notation of Neuwirth with inverse array G(-floor(k/2),1). See A246118 for the unsigned version of the inverse array.

From Peter Bala, Apr 12 2018: (Start)

In the cycle decomposition of a parity preserving permutation, the entries in a given cycle are either all even or all odd. Define T(n,k,i), 1 <= i <= k-1, (a refinement of the table number T(n,k)) to be the number of parity preserving permutations of the set {1,2,...,n} with exactly k cycles and with i of the cycles having all even entries. Clearly, T(n,k) = Sum_{i = 1..k-1} T(n,k,i).

A simple combinatorial argument (cf. Dzhumadil'daev and Yeliussizov, Proposition 5.3) gives the recurrences

T(2*n,k,i) = T(2n-1,k-1,i-1) + (n-1)*T(2*n-1,k,i) and

T(2*n+1,k,i) = T(2*n,k-1,i) + n*T(2*n,k,i).

The solution to these recurrences for n >= 1 is T(2*n,k,i) = S1(n,i)*S1(n,k-i) and T(2*n+1,k,i) = S1(n,i)*S1(n+1,k-i), where S1(n,k) = |A008275(n,k)| denotes the (unsigned) Stirling cycle numbers of the first kind. Kotesovec's formula for T(n,k) below follows immediately from this. Cf. A274310. (End)

Triangle of allowable Stirling numbers of the first kind (with a different offset). See Cai and Readdy, Table 4. - Peter Bala, Apr 14 2018

a(n+1) is also number of ways to place n nonattacking composite pieces semi-rook + semi-bishop on an n X n board. Two semi-bishops (see A187235) do not attack each other if they are in the same northwest-southeast diagonal. Two semi-rooks do not attack each other if they are in the same column (see also semi-queens, A099152). - Vaclav Kotesovec, Dec 22 2011